/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:00:01,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:00:01,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:00:01,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:00:01,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:00:01,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:00:01,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:00:01,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:00:01,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:00:01,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:00:01,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:00:01,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:00:01,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:00:01,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:00:01,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:00:01,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:00:01,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:00:01,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:00:01,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:00:01,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:00:01,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:00:01,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:00:01,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:00:01,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:00:01,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:00:01,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:00:01,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:00:01,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:00:01,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:00:01,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:00:01,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:00:01,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:00:01,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:00:01,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:00:01,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:00:01,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:00:01,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:00:01,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:00:01,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:00:01,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:00:01,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:00:01,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:00:01,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:00:01,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:00:01,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:00:01,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:00:01,589 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:00:01,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:00:01,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:00:01,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:00:01,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:00:01,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:00:01,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:00:01,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:00:01,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:00:01,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:00:01,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:00:01,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:00:01,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 10:00:01,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:00:01,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:00:01,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:00:01,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:00:01,876 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:00:01,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2022-12-13 10:00:02,782 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:00:02,938 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:00:02,939 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2022-12-13 10:00:02,945 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b38e43ad/1efab9798574457b8ea46448c996644b/FLAGf33dcdc8f [2022-12-13 10:00:02,960 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b38e43ad/1efab9798574457b8ea46448c996644b [2022-12-13 10:00:02,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:00:02,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:00:02,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:00:02,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:00:02,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:00:02,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:00:02" (1/1) ... [2022-12-13 10:00:02,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c17b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:02, skipping insertion in model container [2022-12-13 10:00:02,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:00:02" (1/1) ... [2022-12-13 10:00:02,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:00:02,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:00:03,128 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/array-eq-symm.wvr.c[2251,2264] [2022-12-13 10:00:03,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:00:03,154 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:00:03,176 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/array-eq-symm.wvr.c[2251,2264] [2022-12-13 10:00:03,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:00:03,197 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:00:03,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03 WrapperNode [2022-12-13 10:00:03,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:00:03,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:00:03,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:00:03,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:00:03,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,240 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 112 [2022-12-13 10:00:03,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:00:03,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:00:03,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:00:03,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:00:03,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:00:03,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:00:03,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:00:03,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:00:03,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (1/1) ... [2022-12-13 10:00:03,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:00:03,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:03,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:00:03,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:00:03,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:00:03,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:00:03,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:00:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:00:03,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:00:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:00:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:00:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:00:03,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:00:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:00:03,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:00:03,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:00:03,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:00:03,339 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:00:03,419 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:00:03,420 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:00:03,684 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:00:03,690 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:00:03,690 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 10:00:03,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:00:03 BoogieIcfgContainer [2022-12-13 10:00:03,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:00:03,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:00:03,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:00:03,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:00:03,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:00:02" (1/3) ... [2022-12-13 10:00:03,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0f2d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:00:03, skipping insertion in model container [2022-12-13 10:00:03,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:00:03" (2/3) ... [2022-12-13 10:00:03,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0f2d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:00:03, skipping insertion in model container [2022-12-13 10:00:03,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:00:03" (3/3) ... [2022-12-13 10:00:03,697 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2022-12-13 10:00:03,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:00:03,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:00:03,711 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:00:03,772 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 10:00:03,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 159 transitions, 334 flow [2022-12-13 10:00:03,875 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-13 10:00:03,875 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:00:03,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 15/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-12-13 10:00:03,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 159 transitions, 334 flow [2022-12-13 10:00:03,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 149 transitions, 310 flow [2022-12-13 10:00:03,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:03,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 149 transitions, 310 flow [2022-12-13 10:00:03,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 149 transitions, 310 flow [2022-12-13 10:00:03,959 INFO L130 PetriNetUnfolder]: 15/149 cut-off events. [2022-12-13 10:00:03,959 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:00:03,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 149 events. 15/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 121 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-12-13 10:00:03,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 149 transitions, 310 flow [2022-12-13 10:00:03,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 992 [2022-12-13 10:00:08,088 INFO L241 LiptonReduction]: Total number of compositions: 129 [2022-12-13 10:00:08,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:00:08,102 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;@17cff932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:00:08,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 10:00:08,106 INFO L130 PetriNetUnfolder]: 5/18 cut-off events. [2022-12-13 10:00:08,106 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:00:08,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:08,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:08,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1749098858, now seen corresponding path program 1 times [2022-12-13 10:00:08,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:08,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448859166] [2022-12-13 10:00:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448859166] [2022-12-13 10:00:08,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448859166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:08,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:08,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:00:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455659861] [2022-12-13 10:00:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:08,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:00:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:08,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:00:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:00:08,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:00:08,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:08,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:08,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:00:08,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:08,878 INFO L130 PetriNetUnfolder]: 81/151 cut-off events. [2022-12-13 10:00:08,879 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 10:00:08,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 151 events. 81/151 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 24 based on Foata normal form. 2/109 useless extension candidates. Maximal degree in co-relation 204. Up to 73 conditions per place. [2022-12-13 10:00:08,880 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 27 selfloop transitions, 4 changer transitions 13/44 dead transitions. [2022-12-13 10:00:08,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 44 transitions, 209 flow [2022-12-13 10:00:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:00:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:00:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 10:00:08,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-13 10:00:08,889 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 5 states and 48 transitions. [2022-12-13 10:00:08,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 44 transitions, 209 flow [2022-12-13 10:00:08,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 44 transitions, 187 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:08,892 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 77 flow [2022-12-13 10:00:08,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2022-12-13 10:00:08,895 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 10:00:08,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:08,896 INFO L89 Accepts]: Start accepts. Operand has 24 places, 22 transitions, 77 flow [2022-12-13 10:00:08,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:08,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:08,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 22 transitions, 77 flow [2022-12-13 10:00:08,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 77 flow [2022-12-13 10:00:08,902 INFO L130 PetriNetUnfolder]: 12/37 cut-off events. [2022-12-13 10:00:08,903 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:00:08,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 37 events. 12/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 56. Up to 12 conditions per place. [2022-12-13 10:00:08,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 22 transitions, 77 flow [2022-12-13 10:00:08,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 10:00:09,744 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:09,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 850 [2022-12-13 10:00:09,745 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 73 flow [2022-12-13 10:00:09,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:09,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:09,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:09,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:00:09,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 479574592, now seen corresponding path program 1 times [2022-12-13 10:00:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053231558] [2022-12-13 10:00:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:09,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053231558] [2022-12-13 10:00:09,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053231558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:09,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:09,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:00:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823109424] [2022-12-13 10:00:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:09,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:00:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:09,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:00:09,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:00:09,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:00:09,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:09,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:09,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:00:09,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:09,957 INFO L130 PetriNetUnfolder]: 150/267 cut-off events. [2022-12-13 10:00:09,957 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 10:00:09,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 267 events. 150/267 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 852 event pairs, 70 based on Foata normal form. 16/280 useless extension candidates. Maximal degree in co-relation 664. Up to 105 conditions per place. [2022-12-13 10:00:09,959 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 42 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2022-12-13 10:00:09,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 48 transitions, 252 flow [2022-12-13 10:00:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:00:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:00:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-13 10:00:09,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2022-12-13 10:00:09,960 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 73 flow. Second operand 5 states and 46 transitions. [2022-12-13 10:00:09,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 48 transitions, 252 flow [2022-12-13 10:00:09,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 48 transitions, 236 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 10:00:09,962 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 101 flow [2022-12-13 10:00:09,962 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2022-12-13 10:00:09,962 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-13 10:00:09,962 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:09,963 INFO L89 Accepts]: Start accepts. Operand has 27 places, 24 transitions, 101 flow [2022-12-13 10:00:09,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:09,963 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:09,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 24 transitions, 101 flow [2022-12-13 10:00:09,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 101 flow [2022-12-13 10:00:09,968 INFO L130 PetriNetUnfolder]: 14/59 cut-off events. [2022-12-13 10:00:09,968 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-13 10:00:09,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 59 events. 14/59 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 154 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 65. Up to 16 conditions per place. [2022-12-13 10:00:09,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 24 transitions, 101 flow [2022-12-13 10:00:09,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 10:00:10,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:10,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 539 [2022-12-13 10:00:10,501 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 97 flow [2022-12-13 10:00:10,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:10,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:10,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:10,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:00:10,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash -875387484, now seen corresponding path program 1 times [2022-12-13 10:00:10,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:10,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719263159] [2022-12-13 10:00:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:10,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719263159] [2022-12-13 10:00:10,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719263159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:10,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:10,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:00:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086881447] [2022-12-13 10:00:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:10,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:00:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:00:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:00:10,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:00:10,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:10,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:10,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:00:10,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:10,656 INFO L130 PetriNetUnfolder]: 132/236 cut-off events. [2022-12-13 10:00:10,656 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-13 10:00:10,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 132/236 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 717 event pairs, 54 based on Foata normal form. 6/241 useless extension candidates. Maximal degree in co-relation 578. Up to 113 conditions per place. [2022-12-13 10:00:10,658 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 3 changer transitions 10/45 dead transitions. [2022-12-13 10:00:10,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 252 flow [2022-12-13 10:00:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 10:00:10,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-13 10:00:10,659 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 97 flow. Second operand 4 states and 43 transitions. [2022-12-13 10:00:10,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 252 flow [2022-12-13 10:00:10,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 45 transitions, 234 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:10,660 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 93 flow [2022-12-13 10:00:10,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-13 10:00:10,661 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-13 10:00:10,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:10,661 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 93 flow [2022-12-13 10:00:10,662 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:10,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:10,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 93 flow [2022-12-13 10:00:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 93 flow [2022-12-13 10:00:10,666 INFO L130 PetriNetUnfolder]: 13/45 cut-off events. [2022-12-13 10:00:10,666 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 10:00:10,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 45 events. 13/45 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2022-12-13 10:00:10,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 23 transitions, 93 flow [2022-12-13 10:00:10,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:00:10,669 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:10,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 10:00:10,669 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 93 flow [2022-12-13 10:00:10,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:10,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:10,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:10,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:00:10,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1579593735, now seen corresponding path program 1 times [2022-12-13 10:00:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:10,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644378553] [2022-12-13 10:00:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:10,753 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-13 10:00:10,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644378553] [2022-12-13 10:00:10,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644378553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:10,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:10,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:00:10,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145903809] [2022-12-13 10:00:10,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:10,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:00:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:00:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:00:10,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:00:10,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:10,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:10,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:00:10,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:10,797 INFO L130 PetriNetUnfolder]: 113/199 cut-off events. [2022-12-13 10:00:10,799 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-13 10:00:10,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 199 events. 113/199 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 568 event pairs, 45 based on Foata normal form. 10/207 useless extension candidates. Maximal degree in co-relation 336. Up to 113 conditions per place. [2022-12-13 10:00:10,805 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-13 10:00:10,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 198 flow [2022-12-13 10:00:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 10:00:10,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-13 10:00:10,807 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 93 flow. Second operand 4 states and 32 transitions. [2022-12-13 10:00:10,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 198 flow [2022-12-13 10:00:10,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 191 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:00:10,810 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 101 flow [2022-12-13 10:00:10,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-13 10:00:10,811 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-13 10:00:10,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:10,812 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 101 flow [2022-12-13 10:00:10,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:10,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:10,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 101 flow [2022-12-13 10:00:10,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 101 flow [2022-12-13 10:00:10,818 INFO L130 PetriNetUnfolder]: 13/45 cut-off events. [2022-12-13 10:00:10,818 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 10:00:10,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 45 events. 13/45 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2022-12-13 10:00:10,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 101 flow [2022-12-13 10:00:10,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 10:00:10,820 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:10,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 10:00:10,821 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 101 flow [2022-12-13 10:00:10,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:10,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:10,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:10,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:00:10,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1232028078, now seen corresponding path program 1 times [2022-12-13 10:00:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:10,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444619330] [2022-12-13 10:00:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:11,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444619330] [2022-12-13 10:00:11,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444619330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:11,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:11,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:00:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412064777] [2022-12-13 10:00:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:11,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:00:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:00:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:00:11,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:00:11,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 2.142857142857143) 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-13 10:00:11,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:11,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:00:11,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:11,374 INFO L130 PetriNetUnfolder]: 126/219 cut-off events. [2022-12-13 10:00:11,374 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-13 10:00:11,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 219 events. 126/219 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 678 event pairs, 22 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 316. Up to 164 conditions per place. [2022-12-13 10:00:11,375 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 27 selfloop transitions, 10 changer transitions 4/41 dead transitions. [2022-12-13 10:00:11,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 236 flow [2022-12-13 10:00:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:00:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:00:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-12-13 10:00:11,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3007518796992481 [2022-12-13 10:00:11,377 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 101 flow. Second operand 7 states and 40 transitions. [2022-12-13 10:00:11,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 236 flow [2022-12-13 10:00:11,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:11,379 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 155 flow [2022-12-13 10:00:11,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-13 10:00:11,381 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-13 10:00:11,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:11,381 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 155 flow [2022-12-13 10:00:11,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:11,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:11,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 155 flow [2022-12-13 10:00:11,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 155 flow [2022-12-13 10:00:11,388 INFO L130 PetriNetUnfolder]: 27/83 cut-off events. [2022-12-13 10:00:11,388 INFO L131 PetriNetUnfolder]: For 48/50 co-relation queries the response was YES. [2022-12-13 10:00:11,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 83 events. 27/83 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 262 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 172. Up to 28 conditions per place. [2022-12-13 10:00:11,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 155 flow [2022-12-13 10:00:11,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 10:00:11,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:11,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:00:11,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:11,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 10:00:11,526 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 163 flow [2022-12-13 10:00:11,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) 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-13 10:00:11,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:11,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:11,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:00:11,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 236879194, now seen corresponding path program 1 times [2022-12-13 10:00:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:11,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344128046] [2022-12-13 10:00:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:11,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344128046] [2022-12-13 10:00:11,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344128046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:11,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:11,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:00:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838097521] [2022-12-13 10:00:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:11,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:00:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:11,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:00:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:11,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:11,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:11,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:11,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:11,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:12,006 INFO L130 PetriNetUnfolder]: 121/211 cut-off events. [2022-12-13 10:00:12,006 INFO L131 PetriNetUnfolder]: For 372/372 co-relation queries the response was YES. [2022-12-13 10:00:12,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 211 events. 121/211 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 657 event pairs, 20 based on Foata normal form. 6/217 useless extension candidates. Maximal degree in co-relation 603. Up to 162 conditions per place. [2022-12-13 10:00:12,007 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 26 selfloop transitions, 11 changer transitions 7/44 dead transitions. [2022-12-13 10:00:12,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 320 flow [2022-12-13 10:00:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-13 10:00:12,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3188405797101449 [2022-12-13 10:00:12,009 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 163 flow. Second operand 6 states and 44 transitions. [2022-12-13 10:00:12,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 320 flow [2022-12-13 10:00:12,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 288 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 10:00:12,014 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 193 flow [2022-12-13 10:00:12,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2022-12-13 10:00:12,016 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-13 10:00:12,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:12,017 INFO L89 Accepts]: Start accepts. Operand has 34 places, 30 transitions, 193 flow [2022-12-13 10:00:12,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:12,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:12,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 30 transitions, 193 flow [2022-12-13 10:00:12,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 193 flow [2022-12-13 10:00:12,023 INFO L130 PetriNetUnfolder]: 24/79 cut-off events. [2022-12-13 10:00:12,024 INFO L131 PetriNetUnfolder]: For 70/75 co-relation queries the response was YES. [2022-12-13 10:00:12,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 79 events. 24/79 cut-off events. For 70/75 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 265 event pairs, 3 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 151. Up to 27 conditions per place. [2022-12-13 10:00:12,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 30 transitions, 193 flow [2022-12-13 10:00:12,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 10:00:12,026 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:12,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 10:00:12,028 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 193 flow [2022-12-13 10:00:12,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:12,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:12,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:12,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:00:12,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1846017472, now seen corresponding path program 1 times [2022-12-13 10:00:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:12,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778292492] [2022-12-13 10:00:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:12,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778292492] [2022-12-13 10:00:12,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778292492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:12,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:12,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:00:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848758589] [2022-12-13 10:00:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:12,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:00:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:00:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:00:12,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:12,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:12,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:12,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:12,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:12,632 INFO L130 PetriNetUnfolder]: 121/221 cut-off events. [2022-12-13 10:00:12,633 INFO L131 PetriNetUnfolder]: For 418/418 co-relation queries the response was YES. [2022-12-13 10:00:12,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 221 events. 121/221 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 725 event pairs, 27 based on Foata normal form. 4/225 useless extension candidates. Maximal degree in co-relation 544. Up to 162 conditions per place. [2022-12-13 10:00:12,634 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 27 selfloop transitions, 11 changer transitions 10/48 dead transitions. [2022-12-13 10:00:12,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 362 flow [2022-12-13 10:00:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-13 10:00:12,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32608695652173914 [2022-12-13 10:00:12,636 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 193 flow. Second operand 6 states and 45 transitions. [2022-12-13 10:00:12,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 362 flow [2022-12-13 10:00:12,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 351 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:12,639 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 220 flow [2022-12-13 10:00:12,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 10:00:12,639 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 10:00:12,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:12,639 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 220 flow [2022-12-13 10:00:12,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:12,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:12,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 220 flow [2022-12-13 10:00:12,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 220 flow [2022-12-13 10:00:12,646 INFO L130 PetriNetUnfolder]: 22/80 cut-off events. [2022-12-13 10:00:12,647 INFO L131 PetriNetUnfolder]: For 117/122 co-relation queries the response was YES. [2022-12-13 10:00:12,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 80 events. 22/80 cut-off events. For 117/122 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 283 event pairs, 2 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 166. Up to 26 conditions per place. [2022-12-13 10:00:12,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 220 flow [2022-12-13 10:00:12,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 10:00:12,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] L47-5-->L80-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_53| |v_#pthreadsForks_76|) (< v_~i_AB~0_83 v_~An~0_72) (= (select (select |v_#memory_int_162| v_~A~0.base_71) (+ (* v_~i_AB~0_83 4) v_~A~0.offset_71)) |v_thread1Thread1of1ForFork1_#t~mem1_59|) (= |v_#pthreadsForks_75| (+ |v_#pthreadsForks_76| 1)) (= (store |v_#memory_int_162| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_162| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_51| |v_ULTIMATE.start_main_#t~pre13#1_53|)) |v_#memory_int_161|) (< v_~i_AB~0_83 v_~Bn~0_88)) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #pthreadsForks=|v_#pthreadsForks_76|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, #memory_int=|v_#memory_int_162|, ~i_AB~0=v_~i_AB~0_83, ~Bn~0=v_~Bn~0_88, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ~An~0=v_~An~0_72} OutVars{~A~0.base=v_~A~0.base_71, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_53|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_59|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~i_AB~0=v_~i_AB~0_83, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_41|, ~An~0=v_~An~0_72, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_59|, ~A~0.offset=v_~A~0.offset_71, #pthreadsForks=|v_#pthreadsForks_75|, #memory_int=|v_#memory_int_161|, ~Bn~0=v_~Bn~0_88, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:00:12,690 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] L47-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_23| 0) (< v_~i_AB~0_89 v_~Bn~0_92) (= |v_thread1Thread1of1ForFork1_#res.offset_23| 0) (not (let ((.cse0 (* v_~i_AB~0_89 4))) (= (select (select |v_#memory_int_167| v_~A~0.base_75) (+ .cse0 v_~A~0.offset_75)) (select (select |v_#memory_int_167| v_~B~0.base_71) (+ .cse0 v_~B~0.offset_71))))) (< v_~i_AB~0_89 v_~An~0_76)) InVars {~A~0.base=v_~A~0.base_75, ~B~0.base=v_~B~0.base_71, ~A~0.offset=v_~A~0.offset_75, ~i_AB~0=v_~i_AB~0_89, #memory_int=|v_#memory_int_167|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_92, ~An~0=v_~An~0_76} OutVars{~A~0.base=v_~A~0.base_75, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_23|, ~B~0.base=v_~B~0.base_71, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_65|, ~A~0.offset=v_~A~0.offset_75, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_49|, ~i_AB~0=v_~i_AB~0_89, #memory_int=|v_#memory_int_167|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_23|, ~B~0.offset=v_~B~0.offset_71, ~Bn~0=v_~Bn~0_92, ~An~0=v_~An~0_76} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:00:12,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:00:12,846 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:00:12,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-13 10:00:12,847 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 215 flow [2022-12-13 10:00:12,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:12,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:12,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:12,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:00:12,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1996485681, now seen corresponding path program 1 times [2022-12-13 10:00:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325377918] [2022-12-13 10:00:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:13,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325377918] [2022-12-13 10:00:13,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325377918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:13,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163146193] [2022-12-13 10:00:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:13,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:13,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:13,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 10:00:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:13,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:00:13,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:00:13,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:00:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:13,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:13,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:13,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 182 [2022-12-13 10:00:13,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:13,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 104 [2022-12-13 10:00:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:14,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163146193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:14,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:14,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2022-12-13 10:00:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018322869] [2022-12-13 10:00:14,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:14,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:00:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:00:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:00:14,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 10:00:14,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 215 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:14,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:14,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 10:00:14,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:14,250 INFO L130 PetriNetUnfolder]: 118/204 cut-off events. [2022-12-13 10:00:14,250 INFO L131 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2022-12-13 10:00:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 204 events. 118/204 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 604 event pairs, 6 based on Foata normal form. 8/212 useless extension candidates. Maximal degree in co-relation 400. Up to 159 conditions per place. [2022-12-13 10:00:14,252 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 32 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2022-12-13 10:00:14,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 357 flow [2022-12-13 10:00:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-13 10:00:14,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2733333333333333 [2022-12-13 10:00:14,253 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 215 flow. Second operand 6 states and 41 transitions. [2022-12-13 10:00:14,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 357 flow [2022-12-13 10:00:14,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 325 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:14,254 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 229 flow [2022-12-13 10:00:14,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 10:00:14,255 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 10:00:14,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:14,255 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 229 flow [2022-12-13 10:00:14,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:14,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:14,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 229 flow [2022-12-13 10:00:14,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 229 flow [2022-12-13 10:00:14,261 INFO L130 PetriNetUnfolder]: 28/83 cut-off events. [2022-12-13 10:00:14,262 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 10:00:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 83 events. 28/83 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 277 event pairs, 2 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 172. Up to 24 conditions per place. [2022-12-13 10:00:14,262 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 229 flow [2022-12-13 10:00:14,262 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 10:00:14,263 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:14,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 10:00:14,263 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 229 flow [2022-12-13 10:00:14,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:14,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:14,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:14,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:14,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:14,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash 198995376, now seen corresponding path program 1 times [2022-12-13 10:00:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:14,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219114265] [2022-12-13 10:00:14,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:14,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219114265] [2022-12-13 10:00:14,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219114265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:14,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:14,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:00:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697731833] [2022-12-13 10:00:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:14,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:00:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:00:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:14,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 10:00:14,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:14,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:14,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 10:00:14,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:14,895 INFO L130 PetriNetUnfolder]: 114/200 cut-off events. [2022-12-13 10:00:14,895 INFO L131 PetriNetUnfolder]: For 616/616 co-relation queries the response was YES. [2022-12-13 10:00:14,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 200 events. 114/200 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 591 event pairs, 32 based on Foata normal form. 4/204 useless extension candidates. Maximal degree in co-relation 628. Up to 184 conditions per place. [2022-12-13 10:00:14,896 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 25 selfloop transitions, 7 changer transitions 5/37 dead transitions. [2022-12-13 10:00:14,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 318 flow [2022-12-13 10:00:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 10:00:14,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-13 10:00:14,897 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 229 flow. Second operand 4 states and 34 transitions. [2022-12-13 10:00:14,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 318 flow [2022-12-13 10:00:14,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:14,898 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 215 flow [2022-12-13 10:00:14,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 10:00:14,899 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 10:00:14,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:14,899 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 215 flow [2022-12-13 10:00:14,899 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:14,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:14,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 215 flow [2022-12-13 10:00:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 215 flow [2022-12-13 10:00:14,905 INFO L130 PetriNetUnfolder]: 26/78 cut-off events. [2022-12-13 10:00:14,905 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-13 10:00:14,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 78 events. 26/78 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 251 event pairs, 3 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 156. Up to 23 conditions per place. [2022-12-13 10:00:14,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 215 flow [2022-12-13 10:00:14,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 10:00:14,906 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:14,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 10:00:14,907 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 215 flow [2022-12-13 10:00:14,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:14,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:14,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:14,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:00:14,907 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash -380546979, now seen corresponding path program 1 times [2022-12-13 10:00:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:14,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005032397] [2022-12-13 10:00:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:15,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:15,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005032397] [2022-12-13 10:00:15,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005032397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:15,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:15,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:00:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196769697] [2022-12-13 10:00:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:15,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:00:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:00:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:15,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:00:15,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:15,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:15,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:00:15,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:15,376 INFO L130 PetriNetUnfolder]: 112/193 cut-off events. [2022-12-13 10:00:15,377 INFO L131 PetriNetUnfolder]: For 588/588 co-relation queries the response was YES. [2022-12-13 10:00:15,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 193 events. 112/193 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 533 event pairs, 41 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 641. Up to 182 conditions per place. [2022-12-13 10:00:15,378 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 24 selfloop transitions, 9 changer transitions 0/33 dead transitions. [2022-12-13 10:00:15,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 276 flow [2022-12-13 10:00:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-12-13 10:00:15,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2152777777777778 [2022-12-13 10:00:15,380 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 215 flow. Second operand 6 states and 31 transitions. [2022-12-13 10:00:15,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 276 flow [2022-12-13 10:00:15,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:00:15,381 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 206 flow [2022-12-13 10:00:15,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-13 10:00:15,382 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 10:00:15,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:15,382 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 206 flow [2022-12-13 10:00:15,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:15,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:15,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-13 10:00:15,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 206 flow [2022-12-13 10:00:15,389 INFO L130 PetriNetUnfolder]: 24/75 cut-off events. [2022-12-13 10:00:15,389 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-13 10:00:15,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 75 events. 24/75 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 234 event pairs, 4 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 160. Up to 23 conditions per place. [2022-12-13 10:00:15,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-13 10:00:15,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 10:00:15,391 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:15,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 10:00:15,392 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 206 flow [2022-12-13 10:00:15,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:15,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:15,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:15,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:00:15,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1038682392, now seen corresponding path program 1 times [2022-12-13 10:00:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222233650] [2022-12-13 10:00:15,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:15,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:15,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222233650] [2022-12-13 10:00:15,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222233650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:15,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:15,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:00:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251094645] [2022-12-13 10:00:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:15,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:00:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:00:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:15,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:15,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:15,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:15,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:15,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:15,649 INFO L130 PetriNetUnfolder]: 118/203 cut-off events. [2022-12-13 10:00:15,649 INFO L131 PetriNetUnfolder]: For 581/581 co-relation queries the response was YES. [2022-12-13 10:00:15,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 203 events. 118/203 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 573 event pairs, 41 based on Foata normal form. 4/207 useless extension candidates. Maximal degree in co-relation 643. Up to 184 conditions per place. [2022-12-13 10:00:15,650 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 28 selfloop transitions, 7 changer transitions 0/35 dead transitions. [2022-12-13 10:00:15,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 306 flow [2022-12-13 10:00:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 10:00:15,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2022-12-13 10:00:15,651 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 206 flow. Second operand 4 states and 32 transitions. [2022-12-13 10:00:15,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 306 flow [2022-12-13 10:00:15,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 280 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-13 10:00:15,653 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 207 flow [2022-12-13 10:00:15,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 10:00:15,653 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 10:00:15,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:15,653 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 207 flow [2022-12-13 10:00:15,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:15,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:15,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 207 flow [2022-12-13 10:00:15,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 207 flow [2022-12-13 10:00:15,662 INFO L130 PetriNetUnfolder]: 25/78 cut-off events. [2022-12-13 10:00:15,662 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-13 10:00:15,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 78 events. 25/78 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 246 event pairs, 4 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 159. Up to 24 conditions per place. [2022-12-13 10:00:15,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 207 flow [2022-12-13 10:00:15,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:00:15,665 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:15,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 10:00:15,666 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 207 flow [2022-12-13 10:00:15,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:15,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:15,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:15,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:00:15,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash -676543460, now seen corresponding path program 2 times [2022-12-13 10:00:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:15,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375073393] [2022-12-13 10:00:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:16,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375073393] [2022-12-13 10:00:16,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375073393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:16,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895906356] [2022-12-13 10:00:16,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:00:16,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:16,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:16,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:16,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 10:00:16,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:00:16,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:00:16,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 10:00:16,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:16,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-12-13 10:00:16,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-12-13 10:00:16,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:00:16,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:00:16,265 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:00:16,266 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 18 treesize of output 23 [2022-12-13 10:00:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:16,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:16,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:16,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 120 [2022-12-13 10:00:16,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:16,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1049 treesize of output 934 [2022-12-13 10:00:16,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:16,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 853 treesize of output 702 [2022-12-13 10:00:16,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:16,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 693 treesize of output 662 [2022-12-13 10:00:16,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:16,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 593 treesize of output 582 [2022-12-13 10:00:16,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:16,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 573 treesize of output 562 [2022-12-13 10:00:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:24,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895906356] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:24,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:24,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 10:00:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073552982] [2022-12-13 10:00:24,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:24,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:00:24,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:00:24,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=188, Unknown=4, NotChecked=0, Total=240 [2022-12-13 10:00:24,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:24,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 207 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:24,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:24,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:24,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:24,904 INFO L130 PetriNetUnfolder]: 105/180 cut-off events. [2022-12-13 10:00:24,905 INFO L131 PetriNetUnfolder]: For 510/510 co-relation queries the response was YES. [2022-12-13 10:00:24,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 180 events. 105/180 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 498 event pairs, 14 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 572. Up to 117 conditions per place. [2022-12-13 10:00:24,906 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 29 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2022-12-13 10:00:24,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 321 flow [2022-12-13 10:00:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-13 10:00:24,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-13 10:00:24,907 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 207 flow. Second operand 6 states and 36 transitions. [2022-12-13 10:00:24,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 321 flow [2022-12-13 10:00:24,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:00:24,908 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 221 flow [2022-12-13 10:00:24,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 10:00:24,909 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-13 10:00:24,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:24,909 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 221 flow [2022-12-13 10:00:24,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:24,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:24,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 221 flow [2022-12-13 10:00:24,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 221 flow [2022-12-13 10:00:24,915 INFO L130 PetriNetUnfolder]: 23/70 cut-off events. [2022-12-13 10:00:24,915 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-13 10:00:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 70 events. 23/70 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 215 event pairs, 3 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 166. Up to 21 conditions per place. [2022-12-13 10:00:24,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 221 flow [2022-12-13 10:00:24,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:00:24,916 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:24,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 10:00:24,916 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 221 flow [2022-12-13 10:00:24,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:24,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:24,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:24,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:00:25,121 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,SelfDestructingSolverStorable11 [2022-12-13 10:00:25,121 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash -395382877, now seen corresponding path program 1 times [2022-12-13 10:00:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:25,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000400763] [2022-12-13 10:00:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:25,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:25,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000400763] [2022-12-13 10:00:25,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000400763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:25,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084200540] [2022-12-13 10:00:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:25,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:25,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:25,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 10:00:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:25,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:00:25,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:25,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:25,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084200540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:25,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:25,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-13 10:00:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287188869] [2022-12-13 10:00:25,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:25,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:00:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:00:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:00:25,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:25,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 221 flow. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:25,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:25,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:25,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:25,454 INFO L130 PetriNetUnfolder]: 221/373 cut-off events. [2022-12-13 10:00:25,454 INFO L131 PetriNetUnfolder]: For 1203/1203 co-relation queries the response was YES. [2022-12-13 10:00:25,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 373 events. 221/373 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1268 event pairs, 22 based on Foata normal form. 2/375 useless extension candidates. Maximal degree in co-relation 1335. Up to 191 conditions per place. [2022-12-13 10:00:25,456 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 57 selfloop transitions, 15 changer transitions 2/74 dead transitions. [2022-12-13 10:00:25,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 598 flow [2022-12-13 10:00:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:00:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:00:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 10:00:25,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2022-12-13 10:00:25,457 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 221 flow. Second operand 7 states and 70 transitions. [2022-12-13 10:00:25,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 598 flow [2022-12-13 10:00:25,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 572 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 10:00:25,459 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 323 flow [2022-12-13 10:00:25,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 10:00:25,460 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-13 10:00:25,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:25,460 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 323 flow [2022-12-13 10:00:25,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:25,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:25,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 323 flow [2022-12-13 10:00:25,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 323 flow [2022-12-13 10:00:25,468 INFO L130 PetriNetUnfolder]: 41/126 cut-off events. [2022-12-13 10:00:25,469 INFO L131 PetriNetUnfolder]: For 308/311 co-relation queries the response was YES. [2022-12-13 10:00:25,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 126 events. 41/126 cut-off events. For 308/311 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 500 event pairs, 4 based on Foata normal form. 3/123 useless extension candidates. Maximal degree in co-relation 374. Up to 36 conditions per place. [2022-12-13 10:00:25,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 323 flow [2022-12-13 10:00:25,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 10:00:25,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:25,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 10:00:25,471 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 323 flow [2022-12-13 10:00:25,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:25,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:25,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:25,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:25,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:25,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:25,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 630654954, now seen corresponding path program 2 times [2022-12-13 10:00:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:25,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406641974] [2022-12-13 10:00:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:25,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406641974] [2022-12-13 10:00:25,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406641974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:25,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882378166] [2022-12-13 10:00:25,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:00:25,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:25,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:25,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:25,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 10:00:26,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:00:26,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:00:26,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 10:00:26,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:26,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:00:26,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:00:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:26,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:26,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:26,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 176 [2022-12-13 10:00:26,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:00:26,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 90 [2022-12-13 10:00:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:26,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882378166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:26,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:26,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 14 [2022-12-13 10:00:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908448767] [2022-12-13 10:00:26,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:26,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:00:26,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:26,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:00:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:00:26,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:26,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 323 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:26,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:26,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:26,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:26,848 INFO L130 PetriNetUnfolder]: 227/383 cut-off events. [2022-12-13 10:00:26,848 INFO L131 PetriNetUnfolder]: For 1657/1657 co-relation queries the response was YES. [2022-12-13 10:00:26,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 383 events. 227/383 cut-off events. For 1657/1657 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1360 event pairs, 81 based on Foata normal form. 4/387 useless extension candidates. Maximal degree in co-relation 1562. Up to 356 conditions per place. [2022-12-13 10:00:26,850 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 37 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-13 10:00:26,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 458 flow [2022-12-13 10:00:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-13 10:00:26,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2536231884057971 [2022-12-13 10:00:26,851 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 323 flow. Second operand 6 states and 35 transitions. [2022-12-13 10:00:26,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 458 flow [2022-12-13 10:00:26,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 420 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 10:00:26,860 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 322 flow [2022-12-13 10:00:26,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 10:00:26,861 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 10:00:26,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:26,861 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 322 flow [2022-12-13 10:00:26,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:26,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:26,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 322 flow [2022-12-13 10:00:26,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 322 flow [2022-12-13 10:00:26,872 INFO L130 PetriNetUnfolder]: 42/128 cut-off events. [2022-12-13 10:00:26,872 INFO L131 PetriNetUnfolder]: For 338/341 co-relation queries the response was YES. [2022-12-13 10:00:26,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 128 events. 42/128 cut-off events. For 338/341 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 511 event pairs, 4 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 395. Up to 31 conditions per place. [2022-12-13 10:00:26,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 322 flow [2022-12-13 10:00:26,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-13 10:00:26,874 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:26,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 10:00:26,876 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 322 flow [2022-12-13 10:00:26,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:26,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:26,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:26,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:27,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:27,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-13 10:00:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1447059307, now seen corresponding path program 1 times [2022-12-13 10:00:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:27,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069379835] [2022-12-13 10:00:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:27,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:27,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069379835] [2022-12-13 10:00:27,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069379835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:27,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395473170] [2022-12-13 10:00:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:27,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:27,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:27,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:27,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 10:00:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:27,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:00:27,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:27,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:27,329 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-13 10:00:27,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395473170] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:27,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 10:00:27,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 5 [2022-12-13 10:00:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978289719] [2022-12-13 10:00:27,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:27,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:00:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:00:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:00:27,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:00:27,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 322 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:27,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:27,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:00:27,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:27,445 INFO L130 PetriNetUnfolder]: 313/530 cut-off events. [2022-12-13 10:00:27,445 INFO L131 PetriNetUnfolder]: For 2061/2061 co-relation queries the response was YES. [2022-12-13 10:00:27,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 530 events. 313/530 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2101 event pairs, 113 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 2249. Up to 390 conditions per place. [2022-12-13 10:00:27,448 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 51 selfloop transitions, 13 changer transitions 1/65 dead transitions. [2022-12-13 10:00:27,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 612 flow [2022-12-13 10:00:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 10:00:27,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2022-12-13 10:00:27,449 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 322 flow. Second operand 4 states and 47 transitions. [2022-12-13 10:00:27,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 612 flow [2022-12-13 10:00:27,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 584 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:27,452 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 428 flow [2022-12-13 10:00:27,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=428, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-13 10:00:27,453 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 10:00:27,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:27,453 INFO L89 Accepts]: Start accepts. Operand has 50 places, 47 transitions, 428 flow [2022-12-13 10:00:27,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:27,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:27,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 428 flow [2022-12-13 10:00:27,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 428 flow [2022-12-13 10:00:27,464 INFO L130 PetriNetUnfolder]: 54/170 cut-off events. [2022-12-13 10:00:27,464 INFO L131 PetriNetUnfolder]: For 440/444 co-relation queries the response was YES. [2022-12-13 10:00:27,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 170 events. 54/170 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 795 event pairs, 9 based on Foata normal form. 3/164 useless extension candidates. Maximal degree in co-relation 569. Up to 44 conditions per place. [2022-12-13 10:00:27,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 428 flow [2022-12-13 10:00:27,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-13 10:00:27,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] L47-5-->L59-5: Formula: (let ((.cse1 (select |v_#memory_int_159| v_~A~0.base_69))) (and (< v_~i_AB~0_81 v_~An~0_70) (< v_~i_AB~0_81 v_~Bn~0_86) (< v_~i_BA~0_80 v_~An~0_70) (< v_~i_BA~0_80 v_~Bn~0_86) (let ((.cse0 (* 4 v_~i_BA~0_80))) (= (select (select |v_#memory_int_159| v_~B~0.base_67) (+ .cse0 v_~B~0.offset_67)) (select .cse1 (+ .cse0 v_~A~0.offset_69)))) (= (+ 1 v_~i_BA~0_80) v_~i_BA~0_79) (= (select .cse1 (+ v_~A~0.offset_69 (* v_~i_AB~0_81 4))) |v_thread1Thread1of1ForFork1_#t~mem1_57|))) InVars {~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, ~B~0.base=v_~B~0.base_67, #memory_int=|v_#memory_int_159|, ~i_AB~0=v_~i_AB~0_81, ~i_BA~0=v_~i_BA~0_80, ~B~0.offset=v_~B~0.offset_67, ~Bn~0=v_~Bn~0_86, ~An~0=v_~An~0_70} OutVars{~A~0.base=v_~A~0.base_69, ~B~0.base=v_~B~0.base_67, ~i_AB~0=v_~i_AB~0_81, ~An~0=v_~An~0_70, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_19|, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_57|, #memory_int=|v_#memory_int_159|, ~i_BA~0=v_~i_BA~0_79, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_39|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_41|, ~B~0.offset=v_~B~0.offset_67, ~Bn~0=v_~Bn~0_86} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:00:27,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:27,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 10:00:27,514 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 436 flow [2022-12-13 10:00:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:27,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:27,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:27,525 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-13 10:00:27,718 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,SelfDestructingSolverStorable14 [2022-12-13 10:00:27,720 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1491123873, now seen corresponding path program 1 times [2022-12-13 10:00:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:27,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723206976] [2022-12-13 10:00:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723206976] [2022-12-13 10:00:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723206976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600090310] [2022-12-13 10:00:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:27,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:27,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:27,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 10:00:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:27,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 10:00:27,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:27,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-12-13 10:00:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:00:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:00:27,998 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:00:27,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-13 10:00:28,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-12-13 10:00:28,041 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 10:00:28,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 10:00:28,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-12-13 10:00:28,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-12-13 10:00:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:28,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:28,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600090310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:28,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:28,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-13 10:00:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701855064] [2022-12-13 10:00:28,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:28,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:00:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:00:28,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=166, Unknown=14, NotChecked=0, Total=240 [2022-12-13 10:00:28,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:00:28,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 436 flow. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:28,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:28,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:00:28,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:28,795 INFO L130 PetriNetUnfolder]: 377/627 cut-off events. [2022-12-13 10:00:28,795 INFO L131 PetriNetUnfolder]: For 2637/2637 co-relation queries the response was YES. [2022-12-13 10:00:28,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 627 events. 377/627 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2569 event pairs, 105 based on Foata normal form. 16/643 useless extension candidates. Maximal degree in co-relation 2840. Up to 439 conditions per place. [2022-12-13 10:00:28,799 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 64 selfloop transitions, 24 changer transitions 0/88 dead transitions. [2022-12-13 10:00:28,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 915 flow [2022-12-13 10:00:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:00:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:00:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-12-13 10:00:28,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-13 10:00:28,800 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 436 flow. Second operand 10 states and 65 transitions. [2022-12-13 10:00:28,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 915 flow [2022-12-13 10:00:28,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 861 flow, removed 27 selfloop flow, removed 0 redundant places. [2022-12-13 10:00:28,807 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 595 flow [2022-12-13 10:00:28,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=595, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2022-12-13 10:00:28,808 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-13 10:00:28,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:28,808 INFO L89 Accepts]: Start accepts. Operand has 65 places, 58 transitions, 595 flow [2022-12-13 10:00:28,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:28,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:28,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 58 transitions, 595 flow [2022-12-13 10:00:28,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 595 flow [2022-12-13 10:00:28,823 INFO L130 PetriNetUnfolder]: 68/201 cut-off events. [2022-12-13 10:00:28,823 INFO L131 PetriNetUnfolder]: For 945/951 co-relation queries the response was YES. [2022-12-13 10:00:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 201 events. 68/201 cut-off events. For 945/951 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 969 event pairs, 8 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 853. Up to 52 conditions per place. [2022-12-13 10:00:28,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 595 flow [2022-12-13 10:00:28,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 10:00:28,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L47-5-->L47-5: Formula: (let ((.cse0 (select |v_#memory_int_199| v_~A~0.base_88)) (.cse2 (select |v_#memory_int_199| v_~B~0.base_84))) (and (= (+ v_~i_AB~0_108 1) v_~i_AB~0_107) (< v_~i_BA~0_91 v_~An~0_84) (< v_~i_AB~0_108 v_~An~0_84) (let ((.cse1 (* v_~i_AB~0_108 4))) (= (select .cse0 (+ v_~A~0.offset_88 .cse1)) (select .cse2 (+ v_~B~0.offset_84 .cse1)))) (= (+ 1 v_~i_BA~0_91) v_~i_BA~0_90) (let ((.cse3 (* 4 v_~i_BA~0_91))) (= (select .cse0 (+ v_~A~0.offset_88 .cse3)) (select .cse2 (+ v_~B~0.offset_84 .cse3)))) (< v_~i_BA~0_91 v_~Bn~0_100) (< v_~i_AB~0_108 v_~Bn~0_100))) InVars {~A~0.base=v_~A~0.base_88, ~B~0.base=v_~B~0.base_84, ~A~0.offset=v_~A~0.offset_88, ~i_AB~0=v_~i_AB~0_108, #memory_int=|v_#memory_int_199|, ~i_BA~0=v_~i_BA~0_91, ~B~0.offset=v_~B~0.offset_84, ~Bn~0=v_~Bn~0_100, ~An~0=v_~An~0_84} OutVars{~A~0.base=v_~A~0.base_88, ~B~0.base=v_~B~0.base_84, ~i_AB~0=v_~i_AB~0_107, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_40|, ~An~0=v_~An~0_84, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_29|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_90|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_67|, #memory_int=|v_#memory_int_199|, ~i_BA~0=v_~i_BA~0_90, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_60|, ~B~0.offset=v_~B~0.offset_84, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_62|, ~Bn~0=v_~Bn~0_100} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:31,447 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:00:31,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2639 [2022-12-13 10:00:31,447 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 627 flow [2022-12-13 10:00:31,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:31,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:31,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:31,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:31,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 10:00:31,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash 130765713, now seen corresponding path program 1 times [2022-12-13 10:00:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:31,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501088181] [2022-12-13 10:00:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:31,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:31,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501088181] [2022-12-13 10:00:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501088181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:31,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427587929] [2022-12-13 10:00:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:31,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:31,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:31,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 10:00:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:31,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:00:31,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:31,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:00:31,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427587929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:31,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:00:31,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2022-12-13 10:00:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255756042] [2022-12-13 10:00:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:31,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:00:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:00:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:00:31,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 10:00:31,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 627 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:31,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:31,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 10:00:31,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:31,961 INFO L130 PetriNetUnfolder]: 551/954 cut-off events. [2022-12-13 10:00:31,961 INFO L131 PetriNetUnfolder]: For 6548/6548 co-relation queries the response was YES. [2022-12-13 10:00:31,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5188 conditions, 954 events. 551/954 cut-off events. For 6548/6548 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4499 event pairs, 209 based on Foata normal form. 48/1001 useless extension candidates. Maximal degree in co-relation 4894. Up to 622 conditions per place. [2022-12-13 10:00:31,968 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 88 selfloop transitions, 11 changer transitions 2/101 dead transitions. [2022-12-13 10:00:31,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 1252 flow [2022-12-13 10:00:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:00:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:00:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-13 10:00:31,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-13 10:00:31,969 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 627 flow. Second operand 5 states and 58 transitions. [2022-12-13 10:00:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 1252 flow [2022-12-13 10:00:31,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 1160 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:31,979 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 750 flow [2022-12-13 10:00:31,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=750, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2022-12-13 10:00:31,980 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2022-12-13 10:00:31,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:31,980 INFO L89 Accepts]: Start accepts. Operand has 69 places, 67 transitions, 750 flow [2022-12-13 10:00:31,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:31,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:31,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 67 transitions, 750 flow [2022-12-13 10:00:31,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 750 flow [2022-12-13 10:00:32,002 INFO L130 PetriNetUnfolder]: 104/323 cut-off events. [2022-12-13 10:00:32,002 INFO L131 PetriNetUnfolder]: For 1523/1529 co-relation queries the response was YES. [2022-12-13 10:00:32,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 323 events. 104/323 cut-off events. For 1523/1529 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1898 event pairs, 9 based on Foata normal form. 4/311 useless extension candidates. Maximal degree in co-relation 1414. Up to 78 conditions per place. [2022-12-13 10:00:32,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 750 flow [2022-12-13 10:00:32,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 10:00:34,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:34,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2688 [2022-12-13 10:00:34,668 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 770 flow [2022-12-13 10:00:34,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:34,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:34,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:34,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:34,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2097298903, now seen corresponding path program 1 times [2022-12-13 10:00:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:34,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552511680] [2022-12-13 10:00:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:34,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552511680] [2022-12-13 10:00:34,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552511680] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:34,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864839083] [2022-12-13 10:00:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:34,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:34,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:34,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 10:00:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:35,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 10:00:35,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:35,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:00:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864839083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:35,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:00:35,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:00:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12307594] [2022-12-13 10:00:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:00:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:35,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:00:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:35,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 10:00:35,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 770 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:35,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:35,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 10:00:35,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:35,182 INFO L130 PetriNetUnfolder]: 575/1042 cut-off events. [2022-12-13 10:00:35,182 INFO L131 PetriNetUnfolder]: For 6625/6625 co-relation queries the response was YES. [2022-12-13 10:00:35,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 1042 events. 575/1042 cut-off events. For 6625/6625 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5287 event pairs, 274 based on Foata normal form. 54/1095 useless extension candidates. Maximal degree in co-relation 5742. Up to 620 conditions per place. [2022-12-13 10:00:35,189 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 86 selfloop transitions, 9 changer transitions 9/104 dead transitions. [2022-12-13 10:00:35,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 1359 flow [2022-12-13 10:00:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 10:00:35,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2022-12-13 10:00:35,190 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 770 flow. Second operand 4 states and 57 transitions. [2022-12-13 10:00:35,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 1359 flow [2022-12-13 10:00:35,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 1341 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:35,201 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 764 flow [2022-12-13 10:00:35,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=764, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2022-12-13 10:00:35,202 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 10:00:35,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:35,202 INFO L89 Accepts]: Start accepts. Operand has 70 places, 65 transitions, 764 flow [2022-12-13 10:00:35,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:35,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:35,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 65 transitions, 764 flow [2022-12-13 10:00:35,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 764 flow [2022-12-13 10:00:35,225 INFO L130 PetriNetUnfolder]: 84/281 cut-off events. [2022-12-13 10:00:35,225 INFO L131 PetriNetUnfolder]: For 1441/1446 co-relation queries the response was YES. [2022-12-13 10:00:35,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 281 events. 84/281 cut-off events. For 1441/1446 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1603 event pairs, 8 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 1241. Up to 74 conditions per place. [2022-12-13 10:00:35,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 65 transitions, 764 flow [2022-12-13 10:00:35,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 10:00:35,229 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:35,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 10:00:35,231 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 764 flow [2022-12-13 10:00:35,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:35,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:35,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:35,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:35,435 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,SelfDestructingSolverStorable17 [2022-12-13 10:00:35,436 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1504452593, now seen corresponding path program 1 times [2022-12-13 10:00:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455283366] [2022-12-13 10:00:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455283366] [2022-12-13 10:00:35,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455283366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609712991] [2022-12-13 10:00:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:35,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:35,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:35,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:35,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 10:00:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:35,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 10:00:35,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:35,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:00:35,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609712991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:35,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:00:35,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:00:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523539103] [2022-12-13 10:00:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:35,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:00:35,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:00:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:35,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:00:35,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 764 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:35,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:35,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:00:35,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:35,703 INFO L130 PetriNetUnfolder]: 423/747 cut-off events. [2022-12-13 10:00:35,703 INFO L131 PetriNetUnfolder]: For 5229/5229 co-relation queries the response was YES. [2022-12-13 10:00:35,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 747 events. 423/747 cut-off events. For 5229/5229 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3413 event pairs, 187 based on Foata normal form. 26/773 useless extension candidates. Maximal degree in co-relation 3938. Up to 620 conditions per place. [2022-12-13 10:00:35,708 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 56 selfloop transitions, 0 changer transitions 29/85 dead transitions. [2022-12-13 10:00:35,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 1053 flow [2022-12-13 10:00:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 10:00:35,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 10:00:35,709 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 764 flow. Second operand 4 states and 51 transitions. [2022-12-13 10:00:35,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 1053 flow [2022-12-13 10:00:35,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 85 transitions, 1000 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:35,719 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 574 flow [2022-12-13 10:00:35,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=574, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2022-12-13 10:00:35,720 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-13 10:00:35,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:35,720 INFO L89 Accepts]: Start accepts. Operand has 68 places, 56 transitions, 574 flow [2022-12-13 10:00:35,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:35,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:35,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 56 transitions, 574 flow [2022-12-13 10:00:35,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 56 transitions, 574 flow [2022-12-13 10:00:35,734 INFO L130 PetriNetUnfolder]: 69/201 cut-off events. [2022-12-13 10:00:35,734 INFO L131 PetriNetUnfolder]: For 973/977 co-relation queries the response was YES. [2022-12-13 10:00:35,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 201 events. 69/201 cut-off events. For 973/977 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 958 event pairs, 7 based on Foata normal form. 2/193 useless extension candidates. Maximal degree in co-relation 833. Up to 55 conditions per place. [2022-12-13 10:00:35,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 56 transitions, 574 flow [2022-12-13 10:00:35,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 10:00:35,736 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:35,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 10:00:35,737 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 574 flow [2022-12-13 10:00:35,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:35,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:35,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:35,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:35,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:35,944 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:35,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1619634354, now seen corresponding path program 1 times [2022-12-13 10:00:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:35,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921767347] [2022-12-13 10:00:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:35,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921767347] [2022-12-13 10:00:35,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921767347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:35,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:35,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:00:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054236547] [2022-12-13 10:00:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:35,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:00:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:35,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:00:35,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:35,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 10:00:35,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:35,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:35,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 10:00:35,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:36,177 INFO L130 PetriNetUnfolder]: 522/918 cut-off events. [2022-12-13 10:00:36,177 INFO L131 PetriNetUnfolder]: For 6122/6122 co-relation queries the response was YES. [2022-12-13 10:00:36,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5091 conditions, 918 events. 522/918 cut-off events. For 6122/6122 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4318 event pairs, 249 based on Foata normal form. 37/955 useless extension candidates. Maximal degree in co-relation 4781. Up to 619 conditions per place. [2022-12-13 10:00:36,183 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 82 selfloop transitions, 12 changer transitions 1/95 dead transitions. [2022-12-13 10:00:36,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 1185 flow [2022-12-13 10:00:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-13 10:00:36,183 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2022-12-13 10:00:36,184 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 574 flow. Second operand 6 states and 54 transitions. [2022-12-13 10:00:36,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 1185 flow [2022-12-13 10:00:36,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 1109 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:36,192 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 739 flow [2022-12-13 10:00:36,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=739, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2022-12-13 10:00:36,192 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-13 10:00:36,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:36,192 INFO L89 Accepts]: Start accepts. Operand has 67 places, 66 transitions, 739 flow [2022-12-13 10:00:36,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:36,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:36,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 66 transitions, 739 flow [2022-12-13 10:00:36,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 66 transitions, 739 flow [2022-12-13 10:00:36,217 INFO L130 PetriNetUnfolder]: 83/278 cut-off events. [2022-12-13 10:00:36,217 INFO L131 PetriNetUnfolder]: For 1273/1278 co-relation queries the response was YES. [2022-12-13 10:00:36,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 278 events. 83/278 cut-off events. For 1273/1278 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1556 event pairs, 8 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 1172. Up to 74 conditions per place. [2022-12-13 10:00:36,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 66 transitions, 739 flow [2022-12-13 10:00:36,221 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 10:00:36,869 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:00:36,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 678 [2022-12-13 10:00:36,870 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 737 flow [2022-12-13 10:00:36,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:36,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:36,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:36,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 10:00:36,870 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:36,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash 680276685, now seen corresponding path program 1 times [2022-12-13 10:00:36,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:36,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989364984] [2022-12-13 10:00:36,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:36,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:36,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989364984] [2022-12-13 10:00:36,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989364984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:36,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735197812] [2022-12-13 10:00:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:36,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:36,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:36,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:36,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 10:00:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:37,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:00:37,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:37,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:00:37,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735197812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:37,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:00:37,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:00:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263247754] [2022-12-13 10:00:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:37,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:00:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:37,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:00:37,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:00:37,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:00:37,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 737 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:37,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:37,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:00:37,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:37,196 INFO L130 PetriNetUnfolder]: 422/745 cut-off events. [2022-12-13 10:00:37,196 INFO L131 PetriNetUnfolder]: For 4670/4670 co-relation queries the response was YES. [2022-12-13 10:00:37,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 745 events. 422/745 cut-off events. For 4670/4670 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3354 event pairs, 187 based on Foata normal form. 26/771 useless extension candidates. Maximal degree in co-relation 3797. Up to 619 conditions per place. [2022-12-13 10:00:37,203 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 55 selfloop transitions, 1 changer transitions 27/83 dead transitions. [2022-12-13 10:00:37,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 1001 flow [2022-12-13 10:00:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:00:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:00:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-13 10:00:37,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2022-12-13 10:00:37,204 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 737 flow. Second operand 5 states and 49 transitions. [2022-12-13 10:00:37,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 1001 flow [2022-12-13 10:00:37,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 985 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:37,213 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 577 flow [2022-12-13 10:00:37,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2022-12-13 10:00:37,213 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 10:00:37,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:37,214 INFO L89 Accepts]: Start accepts. Operand has 70 places, 56 transitions, 577 flow [2022-12-13 10:00:37,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:37,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:37,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 56 transitions, 577 flow [2022-12-13 10:00:37,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 56 transitions, 577 flow [2022-12-13 10:00:37,233 INFO L130 PetriNetUnfolder]: 69/201 cut-off events. [2022-12-13 10:00:37,233 INFO L131 PetriNetUnfolder]: For 973/977 co-relation queries the response was YES. [2022-12-13 10:00:37,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 201 events. 69/201 cut-off events. For 973/977 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 965 event pairs, 7 based on Foata normal form. 2/193 useless extension candidates. Maximal degree in co-relation 897. Up to 55 conditions per place. [2022-12-13 10:00:37,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 56 transitions, 577 flow [2022-12-13 10:00:37,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 10:00:37,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:37,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:00:37,237 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 577 flow [2022-12-13 10:00:37,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:37,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:37,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:37,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:37,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 10:00:37,443 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:37,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash -613079137, now seen corresponding path program 1 times [2022-12-13 10:00:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654530100] [2022-12-13 10:00:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:37,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654530100] [2022-12-13 10:00:37,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654530100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:37,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778525190] [2022-12-13 10:00:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:37,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:37,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:37,773 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:37,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 10:00:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:37,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:00:37,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:37,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:38,046 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:00:38,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 92 [2022-12-13 10:00:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:38,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778525190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:38,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:38,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2022-12-13 10:00:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374957398] [2022-12-13 10:00:38,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:38,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:00:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:38,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:00:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:00:38,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 10:00:38,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 577 flow. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:38,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:38,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 10:00:38,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:38,367 INFO L130 PetriNetUnfolder]: 388/655 cut-off events. [2022-12-13 10:00:38,367 INFO L131 PetriNetUnfolder]: For 4341/4341 co-relation queries the response was YES. [2022-12-13 10:00:38,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 655 events. 388/655 cut-off events. For 4341/4341 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2728 event pairs, 141 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 3691. Up to 619 conditions per place. [2022-12-13 10:00:38,371 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 53 selfloop transitions, 17 changer transitions 10/80 dead transitions. [2022-12-13 10:00:38,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 80 transitions, 953 flow [2022-12-13 10:00:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:00:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:00:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-12-13 10:00:38,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-13 10:00:38,372 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 577 flow. Second operand 9 states and 52 transitions. [2022-12-13 10:00:38,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 80 transitions, 953 flow [2022-12-13 10:00:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 898 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-13 10:00:38,379 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 683 flow [2022-12-13 10:00:38,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=683, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2022-12-13 10:00:38,380 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-13 10:00:38,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:38,380 INFO L89 Accepts]: Start accepts. Operand has 72 places, 63 transitions, 683 flow [2022-12-13 10:00:38,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:38,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:38,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 683 flow [2022-12-13 10:00:38,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 63 transitions, 683 flow [2022-12-13 10:00:38,394 INFO L130 PetriNetUnfolder]: 71/209 cut-off events. [2022-12-13 10:00:38,394 INFO L131 PetriNetUnfolder]: For 1075/1079 co-relation queries the response was YES. [2022-12-13 10:00:38,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 209 events. 71/209 cut-off events. For 1075/1079 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 997 event pairs, 8 based on Foata normal form. 2/201 useless extension candidates. Maximal degree in co-relation 956. Up to 53 conditions per place. [2022-12-13 10:00:38,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 63 transitions, 683 flow [2022-12-13 10:00:38,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 10:00:39,123 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:00:39,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 744 [2022-12-13 10:00:39,124 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 659 flow [2022-12-13 10:00:39,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:39,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:39,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:39,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 10:00:39,328 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 386873678, now seen corresponding path program 1 times [2022-12-13 10:00:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127098018] [2022-12-13 10:00:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:39,382 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-13 10:00:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:39,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127098018] [2022-12-13 10:00:39,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127098018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:39,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390631041] [2022-12-13 10:00:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:39,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:39,383 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:39,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 10:00:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:39,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:00:39,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:39,513 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-13 10:00:39,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:39,540 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-13 10:00:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390631041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:39,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:39,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:00:39,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432135319] [2022-12-13 10:00:39,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:39,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:00:39,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:39,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:00:39,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:00:39,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 10:00:39,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 659 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:39,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:39,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 10:00:39,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:39,671 INFO L130 PetriNetUnfolder]: 460/829 cut-off events. [2022-12-13 10:00:39,671 INFO L131 PetriNetUnfolder]: For 5717/5717 co-relation queries the response was YES. [2022-12-13 10:00:39,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 829 events. 460/829 cut-off events. For 5717/5717 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3904 event pairs, 122 based on Foata normal form. 33/862 useless extension candidates. Maximal degree in co-relation 4578. Up to 326 conditions per place. [2022-12-13 10:00:39,682 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 67 selfloop transitions, 30 changer transitions 0/97 dead transitions. [2022-12-13 10:00:39,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 1140 flow [2022-12-13 10:00:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:00:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:00:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-13 10:00:39,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2022-12-13 10:00:39,683 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 659 flow. Second operand 6 states and 55 transitions. [2022-12-13 10:00:39,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 1140 flow [2022-12-13 10:00:39,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 97 transitions, 1105 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-13 10:00:39,690 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 777 flow [2022-12-13 10:00:39,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=777, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2022-12-13 10:00:39,691 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 10:00:39,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:39,691 INFO L89 Accepts]: Start accepts. Operand has 70 places, 65 transitions, 777 flow [2022-12-13 10:00:39,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:39,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:39,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 65 transitions, 777 flow [2022-12-13 10:00:39,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 65 transitions, 777 flow [2022-12-13 10:00:39,708 INFO L130 PetriNetUnfolder]: 73/258 cut-off events. [2022-12-13 10:00:39,708 INFO L131 PetriNetUnfolder]: For 1448/1454 co-relation queries the response was YES. [2022-12-13 10:00:39,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 258 events. 73/258 cut-off events. For 1448/1454 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1467 event pairs, 20 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 1196. Up to 71 conditions per place. [2022-12-13 10:00:39,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 65 transitions, 777 flow [2022-12-13 10:00:39,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-13 10:00:39,713 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:39,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 10:00:39,714 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 777 flow [2022-12-13 10:00:39,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:39,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:39,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:39,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 10:00:39,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 10:00:39,922 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 433402586, now seen corresponding path program 1 times [2022-12-13 10:00:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:39,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595026344] [2022-12-13 10:00:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:00:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:40,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595026344] [2022-12-13 10:00:40,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595026344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:40,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:00:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:00:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883954103] [2022-12-13 10:00:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:00:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:00:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:00:40,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 10:00:40,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 777 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:40,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:40,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 10:00:40,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:40,241 INFO L130 PetriNetUnfolder]: 456/825 cut-off events. [2022-12-13 10:00:40,241 INFO L131 PetriNetUnfolder]: For 5982/5982 co-relation queries the response was YES. [2022-12-13 10:00:40,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 825 events. 456/825 cut-off events. For 5982/5982 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3887 event pairs, 201 based on Foata normal form. 4/829 useless extension candidates. Maximal degree in co-relation 4657. Up to 793 conditions per place. [2022-12-13 10:00:40,247 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 56 selfloop transitions, 14 changer transitions 4/74 dead transitions. [2022-12-13 10:00:40,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 973 flow [2022-12-13 10:00:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:00:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:00:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 10:00:40,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 10:00:40,248 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 777 flow. Second operand 5 states and 39 transitions. [2022-12-13 10:00:40,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 973 flow [2022-12-13 10:00:40,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 74 transitions, 923 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:40,257 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 796 flow [2022-12-13 10:00:40,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=796, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2022-12-13 10:00:40,257 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 52 predicate places. [2022-12-13 10:00:40,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:40,257 INFO L89 Accepts]: Start accepts. Operand has 73 places, 67 transitions, 796 flow [2022-12-13 10:00:40,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:40,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:40,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 67 transitions, 796 flow [2022-12-13 10:00:40,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 796 flow [2022-12-13 10:00:40,275 INFO L130 PetriNetUnfolder]: 73/256 cut-off events. [2022-12-13 10:00:40,275 INFO L131 PetriNetUnfolder]: For 1479/1485 co-relation queries the response was YES. [2022-12-13 10:00:40,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 256 events. 73/256 cut-off events. For 1479/1485 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1437 event pairs, 20 based on Foata normal form. 2/242 useless extension candidates. Maximal degree in co-relation 1203. Up to 71 conditions per place. [2022-12-13 10:00:40,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 67 transitions, 796 flow [2022-12-13 10:00:40,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 10:00:40,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:40,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:40,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 10:00:40,339 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 816 flow [2022-12-13 10:00:40,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:40,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:40,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:40,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 10:00:40,339 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:40,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1168858809, now seen corresponding path program 1 times [2022-12-13 10:00:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:40,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542304352] [2022-12-13 10:00:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:40,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542304352] [2022-12-13 10:00:40,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542304352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:40,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493383929] [2022-12-13 10:00:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:40,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:40,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:40,525 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:40,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 10:00:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:40,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 10:00:40,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:40,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:40,695 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:00:40,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:00:40,733 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-13 10:00:40,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493383929] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:40,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 10:00:40,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 10 [2022-12-13 10:00:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616409231] [2022-12-13 10:00:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:40,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:00:40,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:00:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:00:40,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 10:00:40,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 816 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:40,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:40,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 10:00:40,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:40,838 INFO L130 PetriNetUnfolder]: 435/780 cut-off events. [2022-12-13 10:00:40,838 INFO L131 PetriNetUnfolder]: For 5785/5785 co-relation queries the response was YES. [2022-12-13 10:00:40,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4462 conditions, 780 events. 435/780 cut-off events. For 5785/5785 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3591 event pairs, 178 based on Foata normal form. 8/788 useless extension candidates. Maximal degree in co-relation 4425. Up to 725 conditions per place. [2022-12-13 10:00:40,843 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 56 selfloop transitions, 16 changer transitions 1/73 dead transitions. [2022-12-13 10:00:40,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 73 transitions, 1000 flow [2022-12-13 10:00:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:00:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:00:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 10:00:40,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-13 10:00:40,844 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 816 flow. Second operand 4 states and 38 transitions. [2022-12-13 10:00:40,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 73 transitions, 1000 flow [2022-12-13 10:00:40,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 959 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 10:00:40,852 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 806 flow [2022-12-13 10:00:40,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=806, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2022-12-13 10:00:40,853 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-13 10:00:40,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:40,853 INFO L89 Accepts]: Start accepts. Operand has 75 places, 66 transitions, 806 flow [2022-12-13 10:00:40,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:40,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:40,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 66 transitions, 806 flow [2022-12-13 10:00:40,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 66 transitions, 806 flow [2022-12-13 10:00:40,870 INFO L130 PetriNetUnfolder]: 71/242 cut-off events. [2022-12-13 10:00:40,870 INFO L131 PetriNetUnfolder]: For 1626/1632 co-relation queries the response was YES. [2022-12-13 10:00:40,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 242 events. 71/242 cut-off events. For 1626/1632 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1316 event pairs, 18 based on Foata normal form. 2/230 useless extension candidates. Maximal degree in co-relation 1169. Up to 66 conditions per place. [2022-12-13 10:00:40,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 66 transitions, 806 flow [2022-12-13 10:00:40,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 10:00:40,872 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:40,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 10:00:40,873 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 806 flow [2022-12-13 10:00:40,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:40,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:40,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:40,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:41,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 10:00:41,078 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2102901904, now seen corresponding path program 1 times [2022-12-13 10:00:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:41,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418592975] [2022-12-13 10:00:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:41,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:41,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418592975] [2022-12-13 10:00:41,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418592975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:41,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065045110] [2022-12-13 10:00:41,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:41,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:41,355 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:41,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 10:00:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:41,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:00:41,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:41,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:41,589 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:00:41,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 88 [2022-12-13 10:00:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:41,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065045110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:41,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:41,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 10:00:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783723855] [2022-12-13 10:00:41,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:41,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:00:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:41,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:00:41,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:00:41,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 10:00:41,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 806 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:41,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:41,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 10:00:41,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:41,886 INFO L130 PetriNetUnfolder]: 505/901 cut-off events. [2022-12-13 10:00:41,886 INFO L131 PetriNetUnfolder]: For 7305/7305 co-relation queries the response was YES. [2022-12-13 10:00:41,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 901 events. 505/901 cut-off events. For 7305/7305 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4303 event pairs, 170 based on Foata normal form. 24/925 useless extension candidates. Maximal degree in co-relation 5135. Up to 784 conditions per place. [2022-12-13 10:00:41,891 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 74 selfloop transitions, 25 changer transitions 0/99 dead transitions. [2022-12-13 10:00:41,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 1251 flow [2022-12-13 10:00:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:00:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:00:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-12-13 10:00:41,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 10:00:41,892 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 806 flow. Second operand 9 states and 66 transitions. [2022-12-13 10:00:41,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 1251 flow [2022-12-13 10:00:41,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 1172 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 10:00:41,901 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 897 flow [2022-12-13 10:00:41,901 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2022-12-13 10:00:41,901 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2022-12-13 10:00:41,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:41,901 INFO L89 Accepts]: Start accepts. Operand has 79 places, 73 transitions, 897 flow [2022-12-13 10:00:41,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:41,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:41,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 73 transitions, 897 flow [2022-12-13 10:00:41,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 73 transitions, 897 flow [2022-12-13 10:00:41,921 INFO L130 PetriNetUnfolder]: 82/281 cut-off events. [2022-12-13 10:00:41,921 INFO L131 PetriNetUnfolder]: For 1997/2016 co-relation queries the response was YES. [2022-12-13 10:00:41,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 281 events. 82/281 cut-off events. For 1997/2016 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1633 event pairs, 19 based on Foata normal form. 10/276 useless extension candidates. Maximal degree in co-relation 1405. Up to 74 conditions per place. [2022-12-13 10:00:41,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 73 transitions, 897 flow [2022-12-13 10:00:41,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 10:00:41,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L47-5-->L47-5: Formula: (let ((.cse0 (select |v_#memory_int_199| v_~A~0.base_88)) (.cse2 (select |v_#memory_int_199| v_~B~0.base_84))) (and (= (+ v_~i_AB~0_108 1) v_~i_AB~0_107) (< v_~i_BA~0_91 v_~An~0_84) (< v_~i_AB~0_108 v_~An~0_84) (let ((.cse1 (* v_~i_AB~0_108 4))) (= (select .cse0 (+ v_~A~0.offset_88 .cse1)) (select .cse2 (+ v_~B~0.offset_84 .cse1)))) (= (+ 1 v_~i_BA~0_91) v_~i_BA~0_90) (let ((.cse3 (* 4 v_~i_BA~0_91))) (= (select .cse0 (+ v_~A~0.offset_88 .cse3)) (select .cse2 (+ v_~B~0.offset_84 .cse3)))) (< v_~i_BA~0_91 v_~Bn~0_100) (< v_~i_AB~0_108 v_~Bn~0_100))) InVars {~A~0.base=v_~A~0.base_88, ~B~0.base=v_~B~0.base_84, ~A~0.offset=v_~A~0.offset_88, ~i_AB~0=v_~i_AB~0_108, #memory_int=|v_#memory_int_199|, ~i_BA~0=v_~i_BA~0_91, ~B~0.offset=v_~B~0.offset_84, ~Bn~0=v_~Bn~0_100, ~An~0=v_~An~0_84} OutVars{~A~0.base=v_~A~0.base_88, ~B~0.base=v_~B~0.base_84, ~i_AB~0=v_~i_AB~0_107, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_40|, ~An~0=v_~An~0_84, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_29|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_90|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_67|, #memory_int=|v_#memory_int_199|, ~i_BA~0=v_~i_BA~0_90, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_60|, ~B~0.offset=v_~B~0.offset_84, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_62|, ~Bn~0=v_~Bn~0_100} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:42,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] L47-5-->L47-5: Formula: (let ((.cse0 (select |v_#memory_int_199| v_~A~0.base_88)) (.cse2 (select |v_#memory_int_199| v_~B~0.base_84))) (and (= (+ v_~i_AB~0_108 1) v_~i_AB~0_107) (< v_~i_BA~0_91 v_~An~0_84) (< v_~i_AB~0_108 v_~An~0_84) (let ((.cse1 (* v_~i_AB~0_108 4))) (= (select .cse0 (+ v_~A~0.offset_88 .cse1)) (select .cse2 (+ v_~B~0.offset_84 .cse1)))) (= (+ 1 v_~i_BA~0_91) v_~i_BA~0_90) (let ((.cse3 (* 4 v_~i_BA~0_91))) (= (select .cse0 (+ v_~A~0.offset_88 .cse3)) (select .cse2 (+ v_~B~0.offset_84 .cse3)))) (< v_~i_BA~0_91 v_~Bn~0_100) (< v_~i_AB~0_108 v_~Bn~0_100))) InVars {~A~0.base=v_~A~0.base_88, ~B~0.base=v_~B~0.base_84, ~A~0.offset=v_~A~0.offset_88, ~i_AB~0=v_~i_AB~0_108, #memory_int=|v_#memory_int_199|, ~i_BA~0=v_~i_BA~0_91, ~B~0.offset=v_~B~0.offset_84, ~Bn~0=v_~Bn~0_100, ~An~0=v_~An~0_84} OutVars{~A~0.base=v_~A~0.base_88, ~B~0.base=v_~B~0.base_84, ~i_AB~0=v_~i_AB~0_107, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_40|, ~An~0=v_~An~0_84, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_29|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_90|, ~A~0.offset=v_~A~0.offset_88, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_67|, #memory_int=|v_#memory_int_199|, ~i_BA~0=v_~i_BA~0_90, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_60|, ~B~0.offset=v_~B~0.offset_84, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_62|, ~Bn~0=v_~Bn~0_100} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:42,467 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:00:42,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 566 [2022-12-13 10:00:42,467 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 979 flow [2022-12-13 10:00:42,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:42,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:42,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:42,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:42,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:42,668 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1541789444, now seen corresponding path program 1 times [2022-12-13 10:00:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:42,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846063418] [2022-12-13 10:00:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846063418] [2022-12-13 10:00:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846063418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309283596] [2022-12-13 10:00:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:42,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:42,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:42,745 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:42,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 10:00:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:42,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:00:42,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:42,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:42,921 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-13 10:00:42,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309283596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:42,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:42,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-13 10:00:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821903553] [2022-12-13 10:00:42,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:42,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:00:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:00:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:00:42,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 10:00:42,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 979 flow. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:42,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:42,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 10:00:42,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:43,308 INFO L130 PetriNetUnfolder]: 988/1783 cut-off events. [2022-12-13 10:00:43,309 INFO L131 PetriNetUnfolder]: For 15393/15393 co-relation queries the response was YES. [2022-12-13 10:00:43,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10568 conditions, 1783 events. 988/1783 cut-off events. For 15393/15393 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10164 event pairs, 100 based on Foata normal form. 8/1791 useless extension candidates. Maximal degree in co-relation 10530. Up to 660 conditions per place. [2022-12-13 10:00:43,317 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 134 selfloop transitions, 63 changer transitions 6/203 dead transitions. [2022-12-13 10:00:43,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 203 transitions, 2415 flow [2022-12-13 10:00:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:00:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:00:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-12-13 10:00:43,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34598214285714285 [2022-12-13 10:00:43,318 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 979 flow. Second operand 14 states and 155 transitions. [2022-12-13 10:00:43,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 203 transitions, 2415 flow [2022-12-13 10:00:43,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 203 transitions, 2369 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:43,340 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 1461 flow [2022-12-13 10:00:43,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1461, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2022-12-13 10:00:43,341 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 72 predicate places. [2022-12-13 10:00:43,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:43,341 INFO L89 Accepts]: Start accepts. Operand has 93 places, 104 transitions, 1461 flow [2022-12-13 10:00:43,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:43,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:43,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 104 transitions, 1461 flow [2022-12-13 10:00:43,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 104 transitions, 1461 flow [2022-12-13 10:00:43,377 INFO L130 PetriNetUnfolder]: 135/516 cut-off events. [2022-12-13 10:00:43,377 INFO L131 PetriNetUnfolder]: For 4086/4112 co-relation queries the response was YES. [2022-12-13 10:00:43,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 516 events. 135/516 cut-off events. For 4086/4112 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3800 event pairs, 38 based on Foata normal form. 13/499 useless extension candidates. Maximal degree in co-relation 2628. Up to 133 conditions per place. [2022-12-13 10:00:43,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 104 transitions, 1461 flow [2022-12-13 10:00:43,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-13 10:00:43,386 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:43,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 10:00:43,386 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 104 transitions, 1461 flow [2022-12-13 10:00:43,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:43,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:43,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:43,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:43,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 10:00:43,591 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2021062471, now seen corresponding path program 1 times [2022-12-13 10:00:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:43,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81626436] [2022-12-13 10:00:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81626436] [2022-12-13 10:00:43,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81626436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75516324] [2022-12-13 10:00:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:43,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:43,643 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:43,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 10:00:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:43,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:00:43,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:43,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:00:43,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75516324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:43,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:00:43,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:00:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129856643] [2022-12-13 10:00:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:43,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:00:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:00:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:00:43,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 10:00:43,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 1461 flow. Second operand has 5 states, 5 states have (on average 3.0) 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-13 10:00:43,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:43,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 10:00:43,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:44,317 INFO L130 PetriNetUnfolder]: 2237/4086 cut-off events. [2022-12-13 10:00:44,317 INFO L131 PetriNetUnfolder]: For 43861/43861 co-relation queries the response was YES. [2022-12-13 10:00:44,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25361 conditions, 4086 events. 2237/4086 cut-off events. For 43861/43861 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27532 event pairs, 1358 based on Foata normal form. 60/4146 useless extension candidates. Maximal degree in co-relation 25318. Up to 1778 conditions per place. [2022-12-13 10:00:44,341 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 249 selfloop transitions, 8 changer transitions 2/259 dead transitions. [2022-12-13 10:00:44,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 259 transitions, 3913 flow [2022-12-13 10:00:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:00:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:00:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-13 10:00:44,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2022-12-13 10:00:44,342 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 1461 flow. Second operand 7 states and 101 transitions. [2022-12-13 10:00:44,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 259 transitions, 3913 flow [2022-12-13 10:00:44,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 259 transitions, 3528 flow, removed 163 selfloop flow, removed 3 redundant places. [2022-12-13 10:00:44,422 INFO L231 Difference]: Finished difference. Result has 98 places, 111 transitions, 1438 flow [2022-12-13 10:00:44,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1438, PETRI_PLACES=98, PETRI_TRANSITIONS=111} [2022-12-13 10:00:44,422 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-13 10:00:44,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:44,422 INFO L89 Accepts]: Start accepts. Operand has 98 places, 111 transitions, 1438 flow [2022-12-13 10:00:44,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:44,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:44,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 111 transitions, 1438 flow [2022-12-13 10:00:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 111 transitions, 1438 flow [2022-12-13 10:00:44,508 INFO L130 PetriNetUnfolder]: 297/1184 cut-off events. [2022-12-13 10:00:44,508 INFO L131 PetriNetUnfolder]: For 8792/8844 co-relation queries the response was YES. [2022-12-13 10:00:44,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5784 conditions, 1184 events. 297/1184 cut-off events. For 8792/8844 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10973 event pairs, 91 based on Foata normal form. 22/1131 useless extension candidates. Maximal degree in co-relation 5738. Up to 293 conditions per place. [2022-12-13 10:00:44,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 111 transitions, 1438 flow [2022-12-13 10:00:44,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 10:00:49,854 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:49,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5432 [2022-12-13 10:00:49,854 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 111 transitions, 1480 flow [2022-12-13 10:00:49,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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-13 10:00:49,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:49,854 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:49,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 10:00:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 10:00:50,059 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1678259486, now seen corresponding path program 1 times [2022-12-13 10:00:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629251998] [2022-12-13 10:00:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:50,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:50,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629251998] [2022-12-13 10:00:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629251998] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:50,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155242540] [2022-12-13 10:00:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:50,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:50,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:50,121 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:50,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 10:00:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:50,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:00:50,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:50,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:00:50,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155242540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:00:50,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:00:50,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:00:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122236991] [2022-12-13 10:00:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:00:50,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:00:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:00:50,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:00:50,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 10:00:50,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 111 transitions, 1480 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:50,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:50,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 10:00:50,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:50,697 INFO L130 PetriNetUnfolder]: 2161/4040 cut-off events. [2022-12-13 10:00:50,697 INFO L131 PetriNetUnfolder]: For 38801/38801 co-relation queries the response was YES. [2022-12-13 10:00:50,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23566 conditions, 4040 events. 2161/4040 cut-off events. For 38801/38801 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28082 event pairs, 1154 based on Foata normal form. 108/4147 useless extension candidates. Maximal degree in co-relation 21390. Up to 2925 conditions per place. [2022-12-13 10:00:50,720 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 167 selfloop transitions, 21 changer transitions 2/190 dead transitions. [2022-12-13 10:00:50,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 190 transitions, 2719 flow [2022-12-13 10:00:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:00:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:00:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 10:00:50,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2022-12-13 10:00:50,721 INFO L175 Difference]: Start difference. First operand has 98 places, 111 transitions, 1480 flow. Second operand 5 states and 75 transitions. [2022-12-13 10:00:50,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 190 transitions, 2719 flow [2022-12-13 10:00:50,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 190 transitions, 2708 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 10:00:50,796 INFO L231 Difference]: Finished difference. Result has 104 places, 128 transitions, 1855 flow [2022-12-13 10:00:50,796 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1855, PETRI_PLACES=104, PETRI_TRANSITIONS=128} [2022-12-13 10:00:50,797 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 83 predicate places. [2022-12-13 10:00:50,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:50,797 INFO L89 Accepts]: Start accepts. Operand has 104 places, 128 transitions, 1855 flow [2022-12-13 10:00:50,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:50,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:50,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 128 transitions, 1855 flow [2022-12-13 10:00:50,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 128 transitions, 1855 flow [2022-12-13 10:00:50,888 INFO L130 PetriNetUnfolder]: 277/1176 cut-off events. [2022-12-13 10:00:50,889 INFO L131 PetriNetUnfolder]: For 9825/9895 co-relation queries the response was YES. [2022-12-13 10:00:50,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 1176 events. 277/1176 cut-off events. For 9825/9895 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11122 event pairs, 92 based on Foata normal form. 28/1130 useless extension candidates. Maximal degree in co-relation 5196. Up to 298 conditions per place. [2022-12-13 10:00:50,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 128 transitions, 1855 flow [2022-12-13 10:00:50,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-13 10:00:50,901 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:50,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 10:00:50,902 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 128 transitions, 1855 flow [2022-12-13 10:00:50,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:50,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:50,902 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:50,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:51,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 10:00:51,109 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2020332808, now seen corresponding path program 1 times [2022-12-13 10:00:51,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:51,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189440219] [2022-12-13 10:00:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:51,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189440219] [2022-12-13 10:00:51,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189440219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844261218] [2022-12-13 10:00:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:51,308 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:51,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 10:00:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:51,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 10:00:51,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:51,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:51,582 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:00:51,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:00:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:51,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844261218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:51,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:51,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 10:00:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815991530] [2022-12-13 10:00:51,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:51,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:00:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:00:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:00:51,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 10:00:51,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 128 transitions, 1855 flow. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:51,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:51,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 10:00:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:52,474 INFO L130 PetriNetUnfolder]: 2231/4276 cut-off events. [2022-12-13 10:00:52,474 INFO L131 PetriNetUnfolder]: For 44105/44105 co-relation queries the response was YES. [2022-12-13 10:00:52,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25560 conditions, 4276 events. 2231/4276 cut-off events. For 44105/44105 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 30901 event pairs, 497 based on Foata normal form. 52/4328 useless extension candidates. Maximal degree in co-relation 23121. Up to 2488 conditions per place. [2022-12-13 10:00:52,504 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 106 selfloop transitions, 116 changer transitions 39/261 dead transitions. [2022-12-13 10:00:52,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 261 transitions, 3738 flow [2022-12-13 10:00:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:00:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:00:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 139 transitions. [2022-12-13 10:00:52,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26325757575757575 [2022-12-13 10:00:52,505 INFO L175 Difference]: Start difference. First operand has 103 places, 128 transitions, 1855 flow. Second operand 16 states and 139 transitions. [2022-12-13 10:00:52,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 261 transitions, 3738 flow [2022-12-13 10:00:52,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 261 transitions, 3702 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-13 10:00:52,634 INFO L231 Difference]: Finished difference. Result has 120 places, 176 transitions, 2867 flow [2022-12-13 10:00:52,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2867, PETRI_PLACES=120, PETRI_TRANSITIONS=176} [2022-12-13 10:00:52,635 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-13 10:00:52,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:52,635 INFO L89 Accepts]: Start accepts. Operand has 120 places, 176 transitions, 2867 flow [2022-12-13 10:00:52,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:52,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:52,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 176 transitions, 2867 flow [2022-12-13 10:00:52,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 176 transitions, 2867 flow [2022-12-13 10:00:52,738 INFO L130 PetriNetUnfolder]: 287/1237 cut-off events. [2022-12-13 10:00:52,738 INFO L131 PetriNetUnfolder]: For 12608/12662 co-relation queries the response was YES. [2022-12-13 10:00:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 1237 events. 287/1237 cut-off events. For 12608/12662 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11836 event pairs, 64 based on Foata normal form. 12/1195 useless extension candidates. Maximal degree in co-relation 6065. Up to 322 conditions per place. [2022-12-13 10:00:52,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 176 transitions, 2867 flow [2022-12-13 10:00:52,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 10:00:52,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:00:52,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:00:52,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:52,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:52,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:52,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:52,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:00:53,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:00:53,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:53,644 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 10:00:53,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1010 [2022-12-13 10:00:53,645 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 172 transitions, 3089 flow [2022-12-13 10:00:53,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:53,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:53,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:53,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:53,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:53,846 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -358105308, now seen corresponding path program 1 times [2022-12-13 10:00:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:53,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324032304] [2022-12-13 10:00:53,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:54,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324032304] [2022-12-13 10:00:54,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324032304] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:54,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853166041] [2022-12-13 10:00:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:54,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:54,164 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 10:00:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:54,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 10:00:54,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:54,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:54,450 INFO L321 Elim1Store]: treesize reduction 11, result has 87.9 percent of original size [2022-12-13 10:00:54,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 98 [2022-12-13 10:00:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:54,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853166041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:54,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:54,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:00:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625621775] [2022-12-13 10:00:54,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:54,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:00:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:54,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:00:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:00:54,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-13 10:00:54,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 172 transitions, 3089 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:54,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:54,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-13 10:00:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:55,303 INFO L130 PetriNetUnfolder]: 2133/3995 cut-off events. [2022-12-13 10:00:55,303 INFO L131 PetriNetUnfolder]: For 49074/49074 co-relation queries the response was YES. [2022-12-13 10:00:55,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26245 conditions, 3995 events. 2133/3995 cut-off events. For 49074/49074 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27909 event pairs, 932 based on Foata normal form. 24/4019 useless extension candidates. Maximal degree in co-relation 23886. Up to 3588 conditions per place. [2022-12-13 10:00:55,326 INFO L137 encePairwiseOnDemand]: 31/59 looper letters, 178 selfloop transitions, 54 changer transitions 2/234 dead transitions. [2022-12-13 10:00:55,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 234 transitions, 4072 flow [2022-12-13 10:00:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:00:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:00:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-13 10:00:55,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24105461393596986 [2022-12-13 10:00:55,327 INFO L175 Difference]: Start difference. First operand has 114 places, 172 transitions, 3089 flow. Second operand 9 states and 128 transitions. [2022-12-13 10:00:55,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 234 transitions, 4072 flow [2022-12-13 10:00:55,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 234 transitions, 3519 flow, removed 223 selfloop flow, removed 6 redundant places. [2022-12-13 10:00:55,459 INFO L231 Difference]: Finished difference. Result has 120 places, 185 transitions, 2937 flow [2022-12-13 10:00:55,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2606, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2937, PETRI_PLACES=120, PETRI_TRANSITIONS=185} [2022-12-13 10:00:55,460 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-13 10:00:55,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:55,460 INFO L89 Accepts]: Start accepts. Operand has 120 places, 185 transitions, 2937 flow [2022-12-13 10:00:55,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:55,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:55,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 185 transitions, 2937 flow [2022-12-13 10:00:55,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 185 transitions, 2937 flow [2022-12-13 10:00:55,570 INFO L130 PetriNetUnfolder]: 297/1202 cut-off events. [2022-12-13 10:00:55,571 INFO L131 PetriNetUnfolder]: For 11205/11231 co-relation queries the response was YES. [2022-12-13 10:00:55,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6589 conditions, 1202 events. 297/1202 cut-off events. For 11205/11231 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11274 event pairs, 68 based on Foata normal form. 7/1152 useless extension candidates. Maximal degree in co-relation 6097. Up to 305 conditions per place. [2022-12-13 10:00:55,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 185 transitions, 2937 flow [2022-12-13 10:00:55,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 10:00:55,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:55,663 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:55,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:55,791 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:00:55,825 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:00:55,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 367 [2022-12-13 10:00:55,827 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 184 transitions, 2965 flow [2022-12-13 10:00:55,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:55,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:55,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:55,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:56,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:56,038 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 418918083, now seen corresponding path program 1 times [2022-12-13 10:00:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:56,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638001496] [2022-12-13 10:00:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:56,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638001496] [2022-12-13 10:00:56,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638001496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:56,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265944170] [2022-12-13 10:00:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:56,358 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:56,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 10:00:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:56,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 10:00:56,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:56,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:56,589 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:00:56,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:00:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:56,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265944170] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:56,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:56,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 10:00:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831288393] [2022-12-13 10:00:56,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:56,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:00:56,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:56,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:00:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:00:56,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 10:00:56,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 184 transitions, 2965 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:56,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:56,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 10:00:56,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:57,473 INFO L130 PetriNetUnfolder]: 2191/4061 cut-off events. [2022-12-13 10:00:57,473 INFO L131 PetriNetUnfolder]: For 49711/49711 co-relation queries the response was YES. [2022-12-13 10:00:57,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26790 conditions, 4061 events. 2191/4061 cut-off events. For 49711/49711 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 28632 event pairs, 419 based on Foata normal form. 28/4085 useless extension candidates. Maximal degree in co-relation 25849. Up to 2572 conditions per place. [2022-12-13 10:00:57,501 INFO L137 encePairwiseOnDemand]: 19/68 looper letters, 113 selfloop transitions, 138 changer transitions 1/252 dead transitions. [2022-12-13 10:00:57,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 252 transitions, 4109 flow [2022-12-13 10:00:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:00:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:00:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-12-13 10:00:57,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17769607843137256 [2022-12-13 10:00:57,502 INFO L175 Difference]: Start difference. First operand has 119 places, 184 transitions, 2965 flow. Second operand 12 states and 145 transitions. [2022-12-13 10:00:57,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 252 transitions, 4109 flow [2022-12-13 10:00:57,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 252 transitions, 3948 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-12-13 10:00:57,617 INFO L231 Difference]: Finished difference. Result has 130 places, 207 transitions, 3521 flow [2022-12-13 10:00:57,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=2814, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3521, PETRI_PLACES=130, PETRI_TRANSITIONS=207} [2022-12-13 10:00:57,617 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-13 10:00:57,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:57,617 INFO L89 Accepts]: Start accepts. Operand has 130 places, 207 transitions, 3521 flow [2022-12-13 10:00:57,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:57,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:57,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 207 transitions, 3521 flow [2022-12-13 10:00:57,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 207 transitions, 3521 flow [2022-12-13 10:00:57,707 INFO L130 PetriNetUnfolder]: 272/1029 cut-off events. [2022-12-13 10:00:57,707 INFO L131 PetriNetUnfolder]: For 12138/12184 co-relation queries the response was YES. [2022-12-13 10:00:57,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 1029 events. 272/1029 cut-off events. For 12138/12184 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9216 event pairs, 50 based on Foata normal form. 7/991 useless extension candidates. Maximal degree in co-relation 5834. Up to 264 conditions per place. [2022-12-13 10:00:57,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 207 transitions, 3521 flow [2022-12-13 10:00:57,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 842 [2022-12-13 10:00:57,718 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:57,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 10:00:57,718 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 207 transitions, 3521 flow [2022-12-13 10:00:57,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:57,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:57,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:57,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 10:00:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 10:00:57,921 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1163996863, now seen corresponding path program 2 times [2022-12-13 10:00:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:57,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75691604] [2022-12-13 10:00:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:58,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75691604] [2022-12-13 10:00:58,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75691604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:58,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735487569] [2022-12-13 10:00:58,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:00:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:58,145 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:58,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 10:00:58,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:00:58,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:00:58,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 10:00:58,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:00:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:58,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:00:58,380 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:00:58,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:00:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:58,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735487569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:00:58,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:00:58,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:00:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015414201] [2022-12-13 10:00:58,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:00:58,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:00:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:00:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:00:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:00:58,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 10:00:58,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 207 transitions, 3521 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:58,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:00:58,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 10:00:58,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:00:59,215 INFO L130 PetriNetUnfolder]: 1739/3296 cut-off events. [2022-12-13 10:00:59,215 INFO L131 PetriNetUnfolder]: For 45805/45805 co-relation queries the response was YES. [2022-12-13 10:00:59,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22792 conditions, 3296 events. 1739/3296 cut-off events. For 45805/45805 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 23208 event pairs, 304 based on Foata normal form. 44/3336 useless extension candidates. Maximal degree in co-relation 21827. Up to 2143 conditions per place. [2022-12-13 10:00:59,234 INFO L137 encePairwiseOnDemand]: 19/68 looper letters, 123 selfloop transitions, 128 changer transitions 19/270 dead transitions. [2022-12-13 10:00:59,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 270 transitions, 4500 flow [2022-12-13 10:00:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:00:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:00:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 168 transitions. [2022-12-13 10:00:59,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17647058823529413 [2022-12-13 10:00:59,241 INFO L175 Difference]: Start difference. First operand has 130 places, 207 transitions, 3521 flow. Second operand 14 states and 168 transitions. [2022-12-13 10:00:59,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 270 transitions, 4500 flow [2022-12-13 10:00:59,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 270 transitions, 4299 flow, removed 43 selfloop flow, removed 5 redundant places. [2022-12-13 10:00:59,353 INFO L231 Difference]: Finished difference. Result has 138 places, 205 transitions, 3570 flow [2022-12-13 10:00:59,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3570, PETRI_PLACES=138, PETRI_TRANSITIONS=205} [2022-12-13 10:00:59,353 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 117 predicate places. [2022-12-13 10:00:59,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:00:59,353 INFO L89 Accepts]: Start accepts. Operand has 138 places, 205 transitions, 3570 flow [2022-12-13 10:00:59,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:00:59,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:00:59,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 205 transitions, 3570 flow [2022-12-13 10:00:59,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 205 transitions, 3570 flow [2022-12-13 10:00:59,435 INFO L130 PetriNetUnfolder]: 246/956 cut-off events. [2022-12-13 10:00:59,435 INFO L131 PetriNetUnfolder]: For 11181/11228 co-relation queries the response was YES. [2022-12-13 10:00:59,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5924 conditions, 956 events. 246/956 cut-off events. For 11181/11228 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8520 event pairs, 38 based on Foata normal form. 7/922 useless extension candidates. Maximal degree in co-relation 5621. Up to 227 conditions per place. [2022-12-13 10:00:59,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 205 transitions, 3570 flow [2022-12-13 10:00:59,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 10:00:59,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:00:59,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 10:00:59,445 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 3570 flow [2022-12-13 10:00:59,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:00:59,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:00:59,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:00:59,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 10:00:59,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 10:00:59,647 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:00:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:00:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1193878410, now seen corresponding path program 1 times [2022-12-13 10:00:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:00:59,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490827227] [2022-12-13 10:00:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:00:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:00:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:00:59,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490827227] [2022-12-13 10:00:59,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490827227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:00:59,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864850958] [2022-12-13 10:00:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:00:59,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:00:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:00:59,878 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:00:59,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 10:00:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:00:59,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:00:59,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:00,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:00,134 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:01:00,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:01:00,167 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:01:00,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:01:00,182 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:01:00,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:01:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:00,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864850958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:00,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:00,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698281880] [2022-12-13 10:01:00,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:00,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:00,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:01:00,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 10:01:00,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 205 transitions, 3570 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:00,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:00,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 10:01:00,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:00,995 INFO L130 PetriNetUnfolder]: 1657/3097 cut-off events. [2022-12-13 10:01:00,996 INFO L131 PetriNetUnfolder]: For 42788/42788 co-relation queries the response was YES. [2022-12-13 10:01:01,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21697 conditions, 3097 events. 1657/3097 cut-off events. For 42788/42788 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21197 event pairs, 568 based on Foata normal form. 4/3097 useless extension candidates. Maximal degree in co-relation 20763. Up to 3014 conditions per place. [2022-12-13 10:01:01,017 INFO L137 encePairwiseOnDemand]: 45/68 looper letters, 191 selfloop transitions, 40 changer transitions 4/235 dead transitions. [2022-12-13 10:01:01,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 235 transitions, 4227 flow [2022-12-13 10:01:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:01:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:01:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-12-13 10:01:01,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18088235294117647 [2022-12-13 10:01:01,018 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 3570 flow. Second operand 10 states and 123 transitions. [2022-12-13 10:01:01,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 235 transitions, 4227 flow [2022-12-13 10:01:01,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 235 transitions, 3993 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-12-13 10:01:01,155 INFO L231 Difference]: Finished difference. Result has 139 places, 205 transitions, 3430 flow [2022-12-13 10:01:01,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3336, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3430, PETRI_PLACES=139, PETRI_TRANSITIONS=205} [2022-12-13 10:01:01,156 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-13 10:01:01,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:01,156 INFO L89 Accepts]: Start accepts. Operand has 139 places, 205 transitions, 3430 flow [2022-12-13 10:01:01,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:01,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:01,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 205 transitions, 3430 flow [2022-12-13 10:01:01,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 205 transitions, 3430 flow [2022-12-13 10:01:01,263 INFO L130 PetriNetUnfolder]: 245/960 cut-off events. [2022-12-13 10:01:01,263 INFO L131 PetriNetUnfolder]: For 12609/12640 co-relation queries the response was YES. [2022-12-13 10:01:01,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 960 events. 245/960 cut-off events. For 12609/12640 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8564 event pairs, 38 based on Foata normal form. 2/924 useless extension candidates. Maximal degree in co-relation 5707. Up to 227 conditions per place. [2022-12-13 10:01:01,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 205 transitions, 3430 flow [2022-12-13 10:01:01,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 834 [2022-12-13 10:01:01,272 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:01,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 10:01:01,273 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 205 transitions, 3430 flow [2022-12-13 10:01:01,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:01,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:01,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:01,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:01,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:01,478 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1327333920, now seen corresponding path program 2 times [2022-12-13 10:01:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:01,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764090053] [2022-12-13 10:01:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:01,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:01,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764090053] [2022-12-13 10:01:01,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764090053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:01,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557647323] [2022-12-13 10:01:01,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:01:01,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:01,718 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:01,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 10:01:01,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:01:01,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:01:01,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:01:01,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:01,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:02,023 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:01:02,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:01:02,055 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:01:02,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:01:02,067 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:01:02,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:01:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:02,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557647323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:02,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:02,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767703550] [2022-12-13 10:01:02,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:01:02,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 10:01:02,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 205 transitions, 3430 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:02,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:02,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 10:01:02,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:02,928 INFO L130 PetriNetUnfolder]: 1709/3189 cut-off events. [2022-12-13 10:01:02,929 INFO L131 PetriNetUnfolder]: For 52867/52867 co-relation queries the response was YES. [2022-12-13 10:01:02,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22702 conditions, 3189 events. 1709/3189 cut-off events. For 52867/52867 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 21793 event pairs, 546 based on Foata normal form. 44/3229 useless extension candidates. Maximal degree in co-relation 21766. Up to 2924 conditions per place. [2022-12-13 10:01:02,949 INFO L137 encePairwiseOnDemand]: 38/68 looper letters, 207 selfloop transitions, 61 changer transitions 2/270 dead transitions. [2022-12-13 10:01:02,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 270 transitions, 4440 flow [2022-12-13 10:01:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:01:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:01:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2022-12-13 10:01:02,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1832579185520362 [2022-12-13 10:01:02,951 INFO L175 Difference]: Start difference. First operand has 137 places, 205 transitions, 3430 flow. Second operand 13 states and 162 transitions. [2022-12-13 10:01:02,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 270 transitions, 4440 flow [2022-12-13 10:01:03,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 270 transitions, 4367 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 10:01:03,088 INFO L231 Difference]: Finished difference. Result has 145 places, 214 transitions, 3630 flow [2022-12-13 10:01:03,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3357, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3630, PETRI_PLACES=145, PETRI_TRANSITIONS=214} [2022-12-13 10:01:03,089 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2022-12-13 10:01:03,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:03,089 INFO L89 Accepts]: Start accepts. Operand has 145 places, 214 transitions, 3630 flow [2022-12-13 10:01:03,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:03,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:03,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 214 transitions, 3630 flow [2022-12-13 10:01:03,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 214 transitions, 3630 flow [2022-12-13 10:01:03,178 INFO L130 PetriNetUnfolder]: 253/992 cut-off events. [2022-12-13 10:01:03,178 INFO L131 PetriNetUnfolder]: For 14749/14804 co-relation queries the response was YES. [2022-12-13 10:01:03,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6379 conditions, 992 events. 253/992 cut-off events. For 14749/14804 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8924 event pairs, 38 based on Foata normal form. 7/961 useless extension candidates. Maximal degree in co-relation 6064. Up to 229 conditions per place. [2022-12-13 10:01:03,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 214 transitions, 3630 flow [2022-12-13 10:01:03,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 874 [2022-12-13 10:01:03,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:01:03,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:01:03,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:01:03,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:01:03,882 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:01:03,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 793 [2022-12-13 10:01:03,882 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 212 transitions, 3783 flow [2022-12-13 10:01:03,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:03,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:03,883 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:03,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:04,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:04,087 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1051050968, now seen corresponding path program 1 times [2022-12-13 10:01:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:04,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871260712] [2022-12-13 10:01:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:04,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:04,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871260712] [2022-12-13 10:01:04,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871260712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:04,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844554695] [2022-12-13 10:01:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:04,330 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:04,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 10:01:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:04,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 10:01:04,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:04,451 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 34 treesize of output 32 [2022-12-13 10:01:04,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:04,481 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 0 case distinctions, treesize of input 23 treesize of output 28 [2022-12-13 10:01:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:04,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:04,600 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:01:04,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 147 [2022-12-13 10:01:04,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:04,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2022-12-13 10:01:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844554695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:04,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:01:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442140120] [2022-12-13 10:01:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:04,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:01:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:04,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:01:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:01:04,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 10:01:04,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 212 transitions, 3783 flow. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:04,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:04,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 10:01:04,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:05,466 INFO L130 PetriNetUnfolder]: 1725/3221 cut-off events. [2022-12-13 10:01:05,466 INFO L131 PetriNetUnfolder]: For 62802/62802 co-relation queries the response was YES. [2022-12-13 10:01:05,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24275 conditions, 3221 events. 1725/3221 cut-off events. For 62802/62802 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22117 event pairs, 812 based on Foata normal form. 4/3219 useless extension candidates. Maximal degree in co-relation 22809. Up to 3173 conditions per place. [2022-12-13 10:01:05,487 INFO L137 encePairwiseOnDemand]: 57/76 looper letters, 202 selfloop transitions, 23 changer transitions 11/236 dead transitions. [2022-12-13 10:01:05,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 236 transitions, 4475 flow [2022-12-13 10:01:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:01:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:01:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-13 10:01:05,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19736842105263158 [2022-12-13 10:01:05,488 INFO L175 Difference]: Start difference. First operand has 142 places, 212 transitions, 3783 flow. Second operand 7 states and 105 transitions. [2022-12-13 10:01:05,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 236 transitions, 4475 flow [2022-12-13 10:01:05,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 236 transitions, 4278 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-12-13 10:01:05,615 INFO L231 Difference]: Finished difference. Result has 141 places, 216 transitions, 3720 flow [2022-12-13 10:01:05,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=3593, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3720, PETRI_PLACES=141, PETRI_TRANSITIONS=216} [2022-12-13 10:01:05,616 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 120 predicate places. [2022-12-13 10:01:05,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:05,616 INFO L89 Accepts]: Start accepts. Operand has 141 places, 216 transitions, 3720 flow [2022-12-13 10:01:05,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:05,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:05,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 216 transitions, 3720 flow [2022-12-13 10:01:05,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 216 transitions, 3720 flow [2022-12-13 10:01:05,705 INFO L130 PetriNetUnfolder]: 256/997 cut-off events. [2022-12-13 10:01:05,705 INFO L131 PetriNetUnfolder]: For 14623/14685 co-relation queries the response was YES. [2022-12-13 10:01:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 997 events. 256/997 cut-off events. For 14623/14685 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8968 event pairs, 44 based on Foata normal form. 11/966 useless extension candidates. Maximal degree in co-relation 6323. Up to 240 conditions per place. [2022-12-13 10:01:05,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 216 transitions, 3720 flow [2022-12-13 10:01:05,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 10:01:05,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:05,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 10:01:05,717 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 216 transitions, 3720 flow [2022-12-13 10:01:05,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:05,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:05,717 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:05,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 10:01:05,919 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1844221154, now seen corresponding path program 1 times [2022-12-13 10:01:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:05,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783998071] [2022-12-13 10:01:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:06,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783998071] [2022-12-13 10:01:06,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783998071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:06,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581749373] [2022-12-13 10:01:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:06,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:06,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:06,185 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:06,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 10:01:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:06,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 10:01:06,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:06,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:06,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:06,350 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:01:06,350 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 23 treesize of output 28 [2022-12-13 10:01:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:06,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:06,441 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:01:06,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 147 [2022-12-13 10:01:06,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:06,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2022-12-13 10:01:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:06,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581749373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:06,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:06,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330951640] [2022-12-13 10:01:06,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:06,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:01:06,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-13 10:01:06,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 216 transitions, 3720 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:06,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:06,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-13 10:01:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:07,423 INFO L130 PetriNetUnfolder]: 1739/3245 cut-off events. [2022-12-13 10:01:07,423 INFO L131 PetriNetUnfolder]: For 61288/61288 co-relation queries the response was YES. [2022-12-13 10:01:07,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24231 conditions, 3245 events. 1739/3245 cut-off events. For 61288/61288 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 22238 event pairs, 721 based on Foata normal form. 4/3242 useless extension candidates. Maximal degree in co-relation 23871. Up to 3170 conditions per place. [2022-12-13 10:01:07,446 INFO L137 encePairwiseOnDemand]: 48/75 looper letters, 190 selfloop transitions, 39 changer transitions 11/240 dead transitions. [2022-12-13 10:01:07,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 240 transitions, 4397 flow [2022-12-13 10:01:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:01:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:01:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-13 10:01:07,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2038095238095238 [2022-12-13 10:01:07,447 INFO L175 Difference]: Start difference. First operand has 139 places, 216 transitions, 3720 flow. Second operand 7 states and 107 transitions. [2022-12-13 10:01:07,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 240 transitions, 4397 flow [2022-12-13 10:01:07,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 240 transitions, 4357 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 10:01:07,577 INFO L231 Difference]: Finished difference. Result has 144 places, 220 transitions, 3831 flow [2022-12-13 10:01:07,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3680, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3831, PETRI_PLACES=144, PETRI_TRANSITIONS=220} [2022-12-13 10:01:07,578 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-13 10:01:07,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:07,578 INFO L89 Accepts]: Start accepts. Operand has 144 places, 220 transitions, 3831 flow [2022-12-13 10:01:07,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:07,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:07,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 220 transitions, 3831 flow [2022-12-13 10:01:07,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 220 transitions, 3831 flow [2022-12-13 10:01:07,669 INFO L130 PetriNetUnfolder]: 257/1005 cut-off events. [2022-12-13 10:01:07,669 INFO L131 PetriNetUnfolder]: For 14858/14921 co-relation queries the response was YES. [2022-12-13 10:01:07,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6537 conditions, 1005 events. 257/1005 cut-off events. For 14858/14921 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9072 event pairs, 44 based on Foata normal form. 11/972 useless extension candidates. Maximal degree in co-relation 6379. Up to 241 conditions per place. [2022-12-13 10:01:07,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 220 transitions, 3831 flow [2022-12-13 10:01:07,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 890 [2022-12-13 10:01:07,681 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:07,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 10:01:07,681 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 220 transitions, 3831 flow [2022-12-13 10:01:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:07,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:07,681 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:07,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 10:01:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 10:01:07,882 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -656140170, now seen corresponding path program 1 times [2022-12-13 10:01:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:07,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698998187] [2022-12-13 10:01:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698998187] [2022-12-13 10:01:08,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698998187] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:08,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672088637] [2022-12-13 10:01:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:08,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:08,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:08,145 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:08,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 10:01:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:08,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:01:08,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:08,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:08,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:01:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:08,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:08,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:08,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-13 10:01:08,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:08,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-13 10:01:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672088637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:08,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:08,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075129993] [2022-12-13 10:01:08,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:01:08,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-13 10:01:08,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 220 transitions, 3831 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:08,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:08,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-13 10:01:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:09,636 INFO L130 PetriNetUnfolder]: 1737/3247 cut-off events. [2022-12-13 10:01:09,637 INFO L131 PetriNetUnfolder]: For 62840/62840 co-relation queries the response was YES. [2022-12-13 10:01:09,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24320 conditions, 3247 events. 1737/3247 cut-off events. For 62840/62840 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22248 event pairs, 797 based on Foata normal form. 8/3249 useless extension candidates. Maximal degree in co-relation 23903. Up to 3144 conditions per place. [2022-12-13 10:01:09,657 INFO L137 encePairwiseOnDemand]: 48/74 looper letters, 198 selfloop transitions, 42 changer transitions 22/262 dead transitions. [2022-12-13 10:01:09,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 262 transitions, 4663 flow [2022-12-13 10:01:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:01:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:01:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2022-12-13 10:01:09,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16461916461916462 [2022-12-13 10:01:09,660 INFO L175 Difference]: Start difference. First operand has 142 places, 220 transitions, 3831 flow. Second operand 11 states and 134 transitions. [2022-12-13 10:01:09,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 262 transitions, 4663 flow [2022-12-13 10:01:09,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 262 transitions, 4591 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 10:01:09,782 INFO L231 Difference]: Finished difference. Result has 153 places, 222 transitions, 3905 flow [2022-12-13 10:01:09,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=3763, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3905, PETRI_PLACES=153, PETRI_TRANSITIONS=222} [2022-12-13 10:01:09,782 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2022-12-13 10:01:09,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:09,782 INFO L89 Accepts]: Start accepts. Operand has 153 places, 222 transitions, 3905 flow [2022-12-13 10:01:09,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:09,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:09,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 222 transitions, 3905 flow [2022-12-13 10:01:09,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 222 transitions, 3905 flow [2022-12-13 10:01:09,873 INFO L130 PetriNetUnfolder]: 256/999 cut-off events. [2022-12-13 10:01:09,873 INFO L131 PetriNetUnfolder]: For 16249/16316 co-relation queries the response was YES. [2022-12-13 10:01:09,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6655 conditions, 999 events. 256/999 cut-off events. For 16249/16316 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8984 event pairs, 44 based on Foata normal form. 15/974 useless extension candidates. Maximal degree in co-relation 6580. Up to 240 conditions per place. [2022-12-13 10:01:09,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 222 transitions, 3905 flow [2022-12-13 10:01:09,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 882 [2022-12-13 10:01:09,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L47-5-->L80-3: Formula: (let ((.cse0 (select |v_#memory_int_469| v_~A~0.base_248))) (and (= (+ |v_#pthreadsForks_214| 1) |v_#pthreadsForks_213|) (= (store |v_#memory_int_469| |v_ULTIMATE.start_main_~#t2~0#1.base_112| (store (select |v_#memory_int_469| |v_ULTIMATE.start_main_~#t2~0#1.base_112|) |v_ULTIMATE.start_main_~#t2~0#1.offset_112| |v_ULTIMATE.start_main_#t~pre13#1_148|)) |v_#memory_int_468|) (< v_~i_AB~0_356 v_~An~0_224) (= (+ v_~i_AB~0_357 1) v_~i_AB~0_356) (= (select .cse0 (+ (* v_~i_AB~0_356 4) v_~A~0.offset_248)) |v_thread1Thread1of1ForFork1_#t~mem1_326|) (< v_~i_AB~0_356 v_~Bn~0_248) (let ((.cse1 (* v_~i_AB~0_357 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_248)) (select (select |v_#memory_int_469| v_~B~0.base_240) (+ v_~B~0.offset_240 .cse1)))) (= |v_ULTIMATE.start_main_#t~pre13#1_148| |v_#pthreadsForks_214|))) InVars {~A~0.base=v_~A~0.base_248, ~A~0.offset=v_~A~0.offset_248, ~B~0.base=v_~B~0.base_240, #pthreadsForks=|v_#pthreadsForks_214|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_112|, ~i_AB~0=v_~i_AB~0_357, #memory_int=|v_#memory_int_469|, ~Bn~0=v_~Bn~0_248, ~B~0.offset=v_~B~0.offset_240, ~An~0=v_~An~0_224, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_112|} OutVars{~A~0.base=v_~A~0.base_248, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_148|, ~B~0.base=v_~B~0.base_240, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_156|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_112|, ~i_AB~0=v_~i_AB~0_356, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_140|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_119|, ~An~0=v_~An~0_224, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_326|, ~A~0.offset=v_~A~0.offset_248, #pthreadsForks=|v_#pthreadsForks_213|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_184|, #memory_int=|v_#memory_int_468|, ~Bn~0=v_~Bn~0_248, ~B~0.offset=v_~B~0.offset_240, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_112|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:09,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L47-5-->L80-3: Formula: (let ((.cse1 (select |v_#memory_int_453| v_~A~0.base_238))) (and (= (+ |v_#pthreadsForks_202| 1) |v_#pthreadsForks_201|) (< v_~i_AB~0_334 v_~Bn~0_238) (= (+ v_~i_AB~0_335 1) v_~i_AB~0_334) (let ((.cse0 (* v_~i_AB~0_335 4))) (= (select (select |v_#memory_int_453| v_~B~0.base_230) (+ .cse0 v_~B~0.offset_230)) (select .cse1 (+ .cse0 v_~A~0.offset_238)))) (= (select .cse1 (+ v_~A~0.offset_238 (* v_~i_AB~0_334 4))) |v_thread1Thread1of1ForFork1_#t~mem1_310|) (= |v_ULTIMATE.start_main_#t~pre13#1_142| |v_#pthreadsForks_202|) (= (store |v_#memory_int_453| |v_ULTIMATE.start_main_~#t2~0#1.base_106| (store (select |v_#memory_int_453| |v_ULTIMATE.start_main_~#t2~0#1.base_106|) |v_ULTIMATE.start_main_~#t2~0#1.offset_106| |v_ULTIMATE.start_main_#t~pre13#1_142|)) |v_#memory_int_452|) (< v_~i_AB~0_334 v_~An~0_214))) InVars {~A~0.base=v_~A~0.base_238, ~A~0.offset=v_~A~0.offset_238, ~B~0.base=v_~B~0.base_230, #pthreadsForks=|v_#pthreadsForks_202|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_106|, ~i_AB~0=v_~i_AB~0_335, #memory_int=|v_#memory_int_453|, ~Bn~0=v_~Bn~0_238, ~B~0.offset=v_~B~0.offset_230, ~An~0=v_~An~0_214, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_106|} OutVars{~A~0.base=v_~A~0.base_238, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_142|, ~B~0.base=v_~B~0.base_230, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_150|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_106|, ~i_AB~0=v_~i_AB~0_334, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_128|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_113|, ~An~0=v_~An~0_214, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_310|, ~A~0.offset=v_~A~0.offset_238, #pthreadsForks=|v_#pthreadsForks_201|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_170|, #memory_int=|v_#memory_int_452|, ~Bn~0=v_~Bn~0_238, ~B~0.offset=v_~B~0.offset_230, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_106|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:09,985 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:01:09,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 10:01:09,986 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 222 transitions, 3945 flow [2022-12-13 10:01:09,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:09,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:09,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:09,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 10:01:10,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 10:01:10,191 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1955319279, now seen corresponding path program 1 times [2022-12-13 10:01:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:10,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114551197] [2022-12-13 10:01:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:10,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114551197] [2022-12-13 10:01:10,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114551197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:10,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926758002] [2022-12-13 10:01:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:10,435 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:10,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 10:01:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:10,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 10:01:10,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:10,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:10,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 10:01:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:10,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:10,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:10,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 191 [2022-12-13 10:01:10,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:10,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 108 [2022-12-13 10:01:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:11,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926758002] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:11,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:11,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:01:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111065501] [2022-12-13 10:01:11,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:11,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:01:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:11,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:01:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:01:11,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 10:01:11,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 222 transitions, 3945 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:11,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:11,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 10:01:11,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:12,386 INFO L130 PetriNetUnfolder]: 1901/3535 cut-off events. [2022-12-13 10:01:12,387 INFO L131 PetriNetUnfolder]: For 72127/72127 co-relation queries the response was YES. [2022-12-13 10:01:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26622 conditions, 3535 events. 1901/3535 cut-off events. For 72127/72127 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 24475 event pairs, 753 based on Foata normal form. 48/3579 useless extension candidates. Maximal degree in co-relation 26530. Up to 3034 conditions per place. [2022-12-13 10:01:12,412 INFO L137 encePairwiseOnDemand]: 44/76 looper letters, 248 selfloop transitions, 56 changer transitions 12/316 dead transitions. [2022-12-13 10:01:12,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 316 transitions, 5405 flow [2022-12-13 10:01:12,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:01:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:01:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2022-12-13 10:01:12,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19736842105263158 [2022-12-13 10:01:12,413 INFO L175 Difference]: Start difference. First operand has 149 places, 222 transitions, 3945 flow. Second operand 12 states and 180 transitions. [2022-12-13 10:01:12,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 316 transitions, 5405 flow [2022-12-13 10:01:12,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 316 transitions, 5301 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 10:01:12,598 INFO L231 Difference]: Finished difference. Result has 158 places, 235 transitions, 4217 flow [2022-12-13 10:01:12,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=3841, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4217, PETRI_PLACES=158, PETRI_TRANSITIONS=235} [2022-12-13 10:01:12,599 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 137 predicate places. [2022-12-13 10:01:12,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:12,599 INFO L89 Accepts]: Start accepts. Operand has 158 places, 235 transitions, 4217 flow [2022-12-13 10:01:12,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:12,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:12,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 235 transitions, 4217 flow [2022-12-13 10:01:12,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 235 transitions, 4217 flow [2022-12-13 10:01:12,699 INFO L130 PetriNetUnfolder]: 281/1076 cut-off events. [2022-12-13 10:01:12,699 INFO L131 PetriNetUnfolder]: For 21405/21443 co-relation queries the response was YES. [2022-12-13 10:01:12,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7552 conditions, 1076 events. 281/1076 cut-off events. For 21405/21443 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9819 event pairs, 52 based on Foata normal form. 4/1041 useless extension candidates. Maximal degree in co-relation 7119. Up to 250 conditions per place. [2022-12-13 10:01:12,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 235 transitions, 4217 flow [2022-12-13 10:01:12,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 976 [2022-12-13 10:01:12,712 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:12,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 10:01:12,712 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 235 transitions, 4217 flow [2022-12-13 10:01:12,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:12,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:12,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:12,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 10:01:12,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 10:01:12,915 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -133682036, now seen corresponding path program 1 times [2022-12-13 10:01:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:12,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480249806] [2022-12-13 10:01:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:12,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:13,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:13,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480249806] [2022-12-13 10:01:13,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480249806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:13,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616488948] [2022-12-13 10:01:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:13,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:13,173 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:13,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 10:01:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:13,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 10:01:13,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:13,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:13,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:13,366 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:01:13,366 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 22 treesize of output 27 [2022-12-13 10:01:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:13,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:13,546 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:01:13,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 159 [2022-12-13 10:01:13,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:13,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 62 [2022-12-13 10:01:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:13,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616488948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:13,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:13,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081834824] [2022-12-13 10:01:13,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:13,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=140, Unknown=2, NotChecked=0, Total=182 [2022-12-13 10:01:13,623 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 10:01:13,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 235 transitions, 4217 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:13,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:13,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 10:01:13,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:14,440 INFO L130 PetriNetUnfolder]: 1895/3517 cut-off events. [2022-12-13 10:01:14,441 INFO L131 PetriNetUnfolder]: For 90985/90985 co-relation queries the response was YES. [2022-12-13 10:01:14,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28508 conditions, 3517 events. 1895/3517 cut-off events. For 90985/90985 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 24291 event pairs, 782 based on Foata normal form. 12/3527 useless extension candidates. Maximal degree in co-relation 27314. Up to 3151 conditions per place. [2022-12-13 10:01:14,470 INFO L137 encePairwiseOnDemand]: 57/76 looper letters, 231 selfloop transitions, 35 changer transitions 1/267 dead transitions. [2022-12-13 10:01:14,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 267 transitions, 5014 flow [2022-12-13 10:01:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:01:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:01:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 10:01:14,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25877192982456143 [2022-12-13 10:01:14,471 INFO L175 Difference]: Start difference. First operand has 157 places, 235 transitions, 4217 flow. Second operand 6 states and 118 transitions. [2022-12-13 10:01:14,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 267 transitions, 5014 flow [2022-12-13 10:01:14,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 267 transitions, 4921 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 10:01:14,689 INFO L231 Difference]: Finished difference. Result has 159 places, 236 transitions, 4232 flow [2022-12-13 10:01:14,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=4125, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4232, PETRI_PLACES=159, PETRI_TRANSITIONS=236} [2022-12-13 10:01:14,689 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 138 predicate places. [2022-12-13 10:01:14,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:14,689 INFO L89 Accepts]: Start accepts. Operand has 159 places, 236 transitions, 4232 flow [2022-12-13 10:01:14,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:14,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:14,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 236 transitions, 4232 flow [2022-12-13 10:01:14,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 236 transitions, 4232 flow [2022-12-13 10:01:14,796 INFO L130 PetriNetUnfolder]: 285/1087 cut-off events. [2022-12-13 10:01:14,796 INFO L131 PetriNetUnfolder]: For 21716/21782 co-relation queries the response was YES. [2022-12-13 10:01:14,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 1087 events. 285/1087 cut-off events. For 21716/21782 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9929 event pairs, 51 based on Foata normal form. 10/1057 useless extension candidates. Maximal degree in co-relation 7356. Up to 254 conditions per place. [2022-12-13 10:01:14,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 236 transitions, 4232 flow [2022-12-13 10:01:14,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 986 [2022-12-13 10:01:14,809 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:14,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 10:01:14,809 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 236 transitions, 4232 flow [2022-12-13 10:01:14,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:14,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:14,809 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:14,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:15,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 10:01:15,019 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 122731619, now seen corresponding path program 2 times [2022-12-13 10:01:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809631467] [2022-12-13 10:01:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809631467] [2022-12-13 10:01:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809631467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992409820] [2022-12-13 10:01:15,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:01:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:15,150 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:15,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 10:01:15,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:01:15,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:01:15,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 10:01:15,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:15,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992409820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:15,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 11 [2022-12-13 10:01:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693309705] [2022-12-13 10:01:15,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:01:15,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:01:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:01:15,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 10:01:15,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 236 transitions, 4232 flow. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:15,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:15,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 10:01:15,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:16,543 INFO L130 PetriNetUnfolder]: 2849/5317 cut-off events. [2022-12-13 10:01:16,543 INFO L131 PetriNetUnfolder]: For 133927/133927 co-relation queries the response was YES. [2022-12-13 10:01:16,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42256 conditions, 5317 events. 2849/5317 cut-off events. For 133927/133927 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 39627 event pairs, 352 based on Foata normal form. 24/5337 useless extension candidates. Maximal degree in co-relation 39781. Up to 2273 conditions per place. [2022-12-13 10:01:16,587 INFO L137 encePairwiseOnDemand]: 18/76 looper letters, 181 selfloop transitions, 225 changer transitions 9/415 dead transitions. [2022-12-13 10:01:16,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 415 transitions, 7094 flow [2022-12-13 10:01:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 10:01:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 10:01:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 231 transitions. [2022-12-13 10:01:16,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17879256965944273 [2022-12-13 10:01:16,588 INFO L175 Difference]: Start difference. First operand has 159 places, 236 transitions, 4232 flow. Second operand 17 states and 231 transitions. [2022-12-13 10:01:16,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 415 transitions, 7094 flow [2022-12-13 10:01:16,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 415 transitions, 6998 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 10:01:16,918 INFO L231 Difference]: Finished difference. Result has 176 places, 306 transitions, 5914 flow [2022-12-13 10:01:16,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=4084, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5914, PETRI_PLACES=176, PETRI_TRANSITIONS=306} [2022-12-13 10:01:16,919 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 155 predicate places. [2022-12-13 10:01:16,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:16,919 INFO L89 Accepts]: Start accepts. Operand has 176 places, 306 transitions, 5914 flow [2022-12-13 10:01:16,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:16,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:16,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 306 transitions, 5914 flow [2022-12-13 10:01:16,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 306 transitions, 5914 flow [2022-12-13 10:01:17,124 INFO L130 PetriNetUnfolder]: 396/1650 cut-off events. [2022-12-13 10:01:17,125 INFO L131 PetriNetUnfolder]: For 34775/34861 co-relation queries the response was YES. [2022-12-13 10:01:17,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11730 conditions, 1650 events. 396/1650 cut-off events. For 34775/34861 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 16938 event pairs, 75 based on Foata normal form. 17/1611 useless extension candidates. Maximal degree in co-relation 10589. Up to 348 conditions per place. [2022-12-13 10:01:17,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 306 transitions, 5914 flow [2022-12-13 10:01:17,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-13 10:01:17,151 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:17,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-13 10:01:17,151 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 306 transitions, 5914 flow [2022-12-13 10:01:17,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:17,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:17,151 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:17,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 10:01:17,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:17,356 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:17,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash -172009102, now seen corresponding path program 2 times [2022-12-13 10:01:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:17,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619404795] [2022-12-13 10:01:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619404795] [2022-12-13 10:01:17,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619404795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646079643] [2022-12-13 10:01:17,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:01:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:17,592 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:17,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 10:01:17,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:01:17,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:01:17,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:01:17,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:17,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:17,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:01:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:17,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:17,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:17,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-13 10:01:17,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:17,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-13 10:01:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646079643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:18,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 10:01:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349648494] [2022-12-13 10:01:18,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:18,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:01:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:01:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:01:18,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-13 10:01:18,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 306 transitions, 5914 flow. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:18,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:18,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-13 10:01:18,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:19,531 INFO L130 PetriNetUnfolder]: 2841/5309 cut-off events. [2022-12-13 10:01:19,531 INFO L131 PetriNetUnfolder]: For 145434/145434 co-relation queries the response was YES. [2022-12-13 10:01:19,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44557 conditions, 5309 events. 2841/5309 cut-off events. For 145434/145434 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 39528 event pairs, 1168 based on Foata normal form. 8/5313 useless extension candidates. Maximal degree in co-relation 41754. Up to 5143 conditions per place. [2022-12-13 10:01:19,579 INFO L137 encePairwiseOnDemand]: 44/76 looper letters, 278 selfloop transitions, 58 changer transitions 15/351 dead transitions. [2022-12-13 10:01:19,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 351 transitions, 7016 flow [2022-12-13 10:01:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:01:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:01:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-12-13 10:01:19,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13533834586466165 [2022-12-13 10:01:19,580 INFO L175 Difference]: Start difference. First operand has 176 places, 306 transitions, 5914 flow. Second operand 14 states and 144 transitions. [2022-12-13 10:01:19,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 351 transitions, 7016 flow [2022-12-13 10:01:20,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 351 transitions, 6761 flow, removed 111 selfloop flow, removed 2 redundant places. [2022-12-13 10:01:20,010 INFO L231 Difference]: Finished difference. Result has 192 places, 311 transitions, 5882 flow [2022-12-13 10:01:20,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=5659, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5882, PETRI_PLACES=192, PETRI_TRANSITIONS=311} [2022-12-13 10:01:20,011 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 171 predicate places. [2022-12-13 10:01:20,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:20,011 INFO L89 Accepts]: Start accepts. Operand has 192 places, 311 transitions, 5882 flow [2022-12-13 10:01:20,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:20,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:20,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 311 transitions, 5882 flow [2022-12-13 10:01:20,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 311 transitions, 5882 flow [2022-12-13 10:01:20,193 INFO L130 PetriNetUnfolder]: 391/1633 cut-off events. [2022-12-13 10:01:20,193 INFO L131 PetriNetUnfolder]: For 36585/36638 co-relation queries the response was YES. [2022-12-13 10:01:20,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 1633 events. 391/1633 cut-off events. For 36585/36638 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16718 event pairs, 73 based on Foata normal form. 9/1590 useless extension candidates. Maximal degree in co-relation 11585. Up to 343 conditions per place. [2022-12-13 10:01:20,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 311 transitions, 5882 flow [2022-12-13 10:01:20,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 1470 [2022-12-13 10:01:20,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:20,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:01:20,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 10:01:20,301 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 311 transitions, 5904 flow [2022-12-13 10:01:20,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:20,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:20,301 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:20,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 10:01:20,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-13 10:01:20,506 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1007526355, now seen corresponding path program 1 times [2022-12-13 10:01:20,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:20,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581476524] [2022-12-13 10:01:20,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:20,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581476524] [2022-12-13 10:01:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581476524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:20,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760395514] [2022-12-13 10:01:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:20,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:20,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:20,784 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:20,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 10:01:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:20,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:01:20,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:20,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:20,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:01:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:21,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:21,241 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:01:21,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 164 [2022-12-13 10:01:21,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:21,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2022-12-13 10:01:21,543 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:01:21,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:01:21,548 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:01:21,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:01:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760395514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:21,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:21,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606458030] [2022-12-13 10:01:21,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:21,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:01:21,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 10:01:21,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 311 transitions, 5904 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:21,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:21,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 10:01:21,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:23,045 INFO L130 PetriNetUnfolder]: 3010/5642 cut-off events. [2022-12-13 10:01:23,045 INFO L131 PetriNetUnfolder]: For 159725/159725 co-relation queries the response was YES. [2022-12-13 10:01:23,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46162 conditions, 5642 events. 3010/5642 cut-off events. For 159725/159725 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 42463 event pairs, 1143 based on Foata normal form. 68/5706 useless extension candidates. Maximal degree in co-relation 46051. Up to 5126 conditions per place. [2022-12-13 10:01:23,101 INFO L137 encePairwiseOnDemand]: 41/78 looper letters, 294 selfloop transitions, 77 changer transitions 1/372 dead transitions. [2022-12-13 10:01:23,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 372 transitions, 7267 flow [2022-12-13 10:01:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:01:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:01:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-12-13 10:01:23,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17016317016317017 [2022-12-13 10:01:23,103 INFO L175 Difference]: Start difference. First operand has 190 places, 311 transitions, 5904 flow. Second operand 11 states and 146 transitions. [2022-12-13 10:01:23,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 372 transitions, 7267 flow [2022-12-13 10:01:23,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 372 transitions, 7194 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 10:01:23,629 INFO L231 Difference]: Finished difference. Result has 194 places, 326 transitions, 6302 flow [2022-12-13 10:01:23,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=5831, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6302, PETRI_PLACES=194, PETRI_TRANSITIONS=326} [2022-12-13 10:01:23,629 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-13 10:01:23,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:23,629 INFO L89 Accepts]: Start accepts. Operand has 194 places, 326 transitions, 6302 flow [2022-12-13 10:01:23,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:23,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:23,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 326 transitions, 6302 flow [2022-12-13 10:01:23,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 326 transitions, 6302 flow [2022-12-13 10:01:23,819 INFO L130 PetriNetUnfolder]: 418/1792 cut-off events. [2022-12-13 10:01:23,819 INFO L131 PetriNetUnfolder]: For 39876/39940 co-relation queries the response was YES. [2022-12-13 10:01:23,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12658 conditions, 1792 events. 418/1792 cut-off events. For 39876/39940 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 18815 event pairs, 73 based on Foata normal form. 5/1744 useless extension candidates. Maximal degree in co-relation 11811. Up to 357 conditions per place. [2022-12-13 10:01:23,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 326 transitions, 6302 flow [2022-12-13 10:01:23,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-13 10:01:23,843 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:23,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 10:01:23,843 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 326 transitions, 6302 flow [2022-12-13 10:01:23,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:23,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:23,843 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:23,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 10:01:24,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:24,048 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1541188938, now seen corresponding path program 3 times [2022-12-13 10:01:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:24,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400704115] [2022-12-13 10:01:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:24,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:24,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400704115] [2022-12-13 10:01:24,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400704115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:24,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628189236] [2022-12-13 10:01:24,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 10:01:24,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:24,289 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:24,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 10:01:24,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 10:01:24,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:01:24,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 10:01:24,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:24,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:24,442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 10:01:24,447 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 202 treesize of output 198 [2022-12-13 10:01:24,460 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:01:24,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 10:01:24,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:24,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:01:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:24,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:24,616 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (~B~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2109))) (let ((.cse0 (select .cse2 ~B~0.base))) (or (not (let ((.cse1 (* c_~i_BA~0 4))) (= (select .cse0 (+ .cse1 4 c_~B~0.offset)) (select (select .cse2 c_~A~0.base) (+ c_~A~0.offset .cse1 4))))) (let ((.cse3 (* c_~i_AB~0 4))) (= (select .cse0 (+ 4 c_~B~0.offset .cse3)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4 .cse3)))))))) is different from false [2022-12-13 10:01:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:24,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628189236] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:24,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:24,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 10:01:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14375318] [2022-12-13 10:01:24,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:24,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:01:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:01:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=147, Unknown=1, NotChecked=24, Total=210 [2022-12-13 10:01:24,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 10:01:24,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 326 transitions, 6302 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:24,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:24,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 10:01:24,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:26,024 INFO L130 PetriNetUnfolder]: 3016/5652 cut-off events. [2022-12-13 10:01:26,024 INFO L131 PetriNetUnfolder]: For 163654/163654 co-relation queries the response was YES. [2022-12-13 10:01:26,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47519 conditions, 5652 events. 3016/5652 cut-off events. For 163654/163654 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 42878 event pairs, 1318 based on Foata normal form. 4/5652 useless extension candidates. Maximal degree in co-relation 44348. Up to 5522 conditions per place. [2022-12-13 10:01:26,077 INFO L137 encePairwiseOnDemand]: 55/78 looper letters, 310 selfloop transitions, 40 changer transitions 3/353 dead transitions. [2022-12-13 10:01:26,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 353 transitions, 7268 flow [2022-12-13 10:01:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:01:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:01:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2022-12-13 10:01:26,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14871794871794872 [2022-12-13 10:01:26,078 INFO L175 Difference]: Start difference. First operand has 193 places, 326 transitions, 6302 flow. Second operand 10 states and 116 transitions. [2022-12-13 10:01:26,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 353 transitions, 7268 flow [2022-12-13 10:01:26,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 353 transitions, 7169 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 10:01:26,626 INFO L231 Difference]: Finished difference. Result has 198 places, 332 transitions, 6407 flow [2022-12-13 10:01:26,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=6203, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6407, PETRI_PLACES=198, PETRI_TRANSITIONS=332} [2022-12-13 10:01:26,626 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 177 predicate places. [2022-12-13 10:01:26,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:26,627 INFO L89 Accepts]: Start accepts. Operand has 198 places, 332 transitions, 6407 flow [2022-12-13 10:01:26,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:26,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:26,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 332 transitions, 6407 flow [2022-12-13 10:01:26,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 332 transitions, 6407 flow [2022-12-13 10:01:26,820 INFO L130 PetriNetUnfolder]: 418/1791 cut-off events. [2022-12-13 10:01:26,820 INFO L131 PetriNetUnfolder]: For 39996/40077 co-relation queries the response was YES. [2022-12-13 10:01:26,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12665 conditions, 1791 events. 418/1791 cut-off events. For 39996/40077 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 18825 event pairs, 73 based on Foata normal form. 10/1746 useless extension candidates. Maximal degree in co-relation 12573. Up to 358 conditions per place. [2022-12-13 10:01:26,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 332 transitions, 6407 flow [2022-12-13 10:01:26,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 1608 [2022-12-13 10:01:26,844 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:26,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-13 10:01:26,845 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 332 transitions, 6407 flow [2022-12-13 10:01:26,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:26,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:26,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:26,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:27,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:27,046 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 278895652, now seen corresponding path program 1 times [2022-12-13 10:01:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:27,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577287485] [2022-12-13 10:01:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:27,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:27,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577287485] [2022-12-13 10:01:27,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577287485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:01:27,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:01:27,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:01:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175266282] [2022-12-13 10:01:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:01:27,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:01:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:01:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:01:27,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 10:01:27,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 332 transitions, 6407 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:27,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:27,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 10:01:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:28,462 INFO L130 PetriNetUnfolder]: 3053/5710 cut-off events. [2022-12-13 10:01:28,462 INFO L131 PetriNetUnfolder]: For 166845/166845 co-relation queries the response was YES. [2022-12-13 10:01:28,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48148 conditions, 5710 events. 3053/5710 cut-off events. For 166845/166845 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 43168 event pairs, 1431 based on Foata normal form. 4/5709 useless extension candidates. Maximal degree in co-relation 48041. Up to 5651 conditions per place. [2022-12-13 10:01:28,509 INFO L137 encePairwiseOnDemand]: 45/78 looper letters, 327 selfloop transitions, 42 changer transitions 0/369 dead transitions. [2022-12-13 10:01:28,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 369 transitions, 7786 flow [2022-12-13 10:01:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:01:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:01:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-13 10:01:28,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2606837606837607 [2022-12-13 10:01:28,510 INFO L175 Difference]: Start difference. First operand has 198 places, 332 transitions, 6407 flow. Second operand 6 states and 122 transitions. [2022-12-13 10:01:28,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 369 transitions, 7786 flow [2022-12-13 10:01:29,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 369 transitions, 7697 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-13 10:01:29,045 INFO L231 Difference]: Finished difference. Result has 199 places, 353 transitions, 7011 flow [2022-12-13 10:01:29,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=6324, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7011, PETRI_PLACES=199, PETRI_TRANSITIONS=353} [2022-12-13 10:01:29,046 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 178 predicate places. [2022-12-13 10:01:29,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:29,046 INFO L89 Accepts]: Start accepts. Operand has 199 places, 353 transitions, 7011 flow [2022-12-13 10:01:29,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:29,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:29,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 353 transitions, 7011 flow [2022-12-13 10:01:29,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 353 transitions, 7011 flow [2022-12-13 10:01:29,248 INFO L130 PetriNetUnfolder]: 436/1830 cut-off events. [2022-12-13 10:01:29,248 INFO L131 PetriNetUnfolder]: For 43672/43788 co-relation queries the response was YES. [2022-12-13 10:01:29,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13292 conditions, 1830 events. 436/1830 cut-off events. For 43672/43788 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 19105 event pairs, 72 based on Foata normal form. 24/1797 useless extension candidates. Maximal degree in co-relation 12547. Up to 373 conditions per place. [2022-12-13 10:01:29,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 353 transitions, 7011 flow [2022-12-13 10:01:29,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 1638 [2022-12-13 10:01:31,283 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:01:31,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2237 [2022-12-13 10:01:31,284 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 353 transitions, 7037 flow [2022-12-13 10:01:31,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:31,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:31,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:31,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 10:01:31,284 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash 723176385, now seen corresponding path program 2 times [2022-12-13 10:01:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:31,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964007354] [2022-12-13 10:01:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:31,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964007354] [2022-12-13 10:01:31,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964007354] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082546080] [2022-12-13 10:01:31,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:01:31,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:31,504 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 10:01:31,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:01:31,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:01:31,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 10:01:31,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:31,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:31,668 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 10:01:31,674 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 96 treesize of output 94 [2022-12-13 10:01:31,685 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:01:31,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 10:01:31,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:31,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:01:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:31,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:32,608 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~i_AB~0 4))) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4 .cse4)))) (let ((.cse0 (forall ((v_ArrVal_2218 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (not (= .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2218) ~B~0.base) (+ ~B~0.offset 4 .cse4)))))) (.cse1 (+ c_~i_BA~0 1))) (and (or .cse0 (< .cse1 c_~Bn~0)) (or .cse0 (< .cse1 c_~An~0)) (forall ((v_ArrVal_2218 (Array Int Int)) (~B~0.offset Int) (~B~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2218))) (let ((.cse3 (select .cse5 ~B~0.base))) (or (not (= .cse2 (select .cse3 (+ ~B~0.offset 4 .cse4)))) (let ((.cse6 (* c_~i_BA~0 4))) (= (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse6 4)) (select .cse3 (+ .cse6 ~B~0.offset 4)))))))))))) is different from false [2022-12-13 10:01:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:32,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082546080] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:32,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:32,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:32,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856558373] [2022-12-13 10:01:32,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:32,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:32,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:32,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2022-12-13 10:01:32,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 80 [2022-12-13 10:01:32,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 353 transitions, 7037 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:32,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:32,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 80 [2022-12-13 10:01:32,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:34,129 INFO L130 PetriNetUnfolder]: 3040/5651 cut-off events. [2022-12-13 10:01:34,130 INFO L131 PetriNetUnfolder]: For 168879/168879 co-relation queries the response was YES. [2022-12-13 10:01:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48198 conditions, 5651 events. 3040/5651 cut-off events. For 168879/168879 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 42563 event pairs, 1153 based on Foata normal form. 2/5647 useless extension candidates. Maximal degree in co-relation 45612. Up to 5537 conditions per place. [2022-12-13 10:01:34,185 INFO L137 encePairwiseOnDemand]: 49/80 looper letters, 311 selfloop transitions, 62 changer transitions 5/378 dead transitions. [2022-12-13 10:01:34,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 378 transitions, 7899 flow [2022-12-13 10:01:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:01:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:01:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2022-12-13 10:01:34,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14431818181818182 [2022-12-13 10:01:34,186 INFO L175 Difference]: Start difference. First operand has 199 places, 353 transitions, 7037 flow. Second operand 11 states and 127 transitions. [2022-12-13 10:01:34,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 378 transitions, 7899 flow [2022-12-13 10:01:34,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 378 transitions, 7827 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:01:34,776 INFO L231 Difference]: Finished difference. Result has 208 places, 353 transitions, 7101 flow [2022-12-13 10:01:34,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=6965, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7101, PETRI_PLACES=208, PETRI_TRANSITIONS=353} [2022-12-13 10:01:34,776 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 187 predicate places. [2022-12-13 10:01:34,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:34,776 INFO L89 Accepts]: Start accepts. Operand has 208 places, 353 transitions, 7101 flow [2022-12-13 10:01:34,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:34,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:34,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 353 transitions, 7101 flow [2022-12-13 10:01:34,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 353 transitions, 7101 flow [2022-12-13 10:01:35,045 INFO L130 PetriNetUnfolder]: 432/1786 cut-off events. [2022-12-13 10:01:35,045 INFO L131 PetriNetUnfolder]: For 45307/45406 co-relation queries the response was YES. [2022-12-13 10:01:35,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13181 conditions, 1786 events. 432/1786 cut-off events. For 45307/45406 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 18527 event pairs, 73 based on Foata normal form. 16/1743 useless extension candidates. Maximal degree in co-relation 12359. Up to 367 conditions per place. [2022-12-13 10:01:35,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 353 transitions, 7101 flow [2022-12-13 10:01:35,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 1638 [2022-12-13 10:01:35,067 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:35,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-13 10:01:35,068 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 353 transitions, 7101 flow [2022-12-13 10:01:35,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:35,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:35,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:35,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:35,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 10:01:35,271 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 29534600, now seen corresponding path program 1 times [2022-12-13 10:01:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:35,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491328805] [2022-12-13 10:01:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:35,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491328805] [2022-12-13 10:01:35,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491328805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:35,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291455321] [2022-12-13 10:01:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:35,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:35,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:35,517 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:35,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 10:01:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:35,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 10:01:35,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:35,664 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 34 treesize of output 32 [2022-12-13 10:01:35,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:01:35,726 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 0 case distinctions, treesize of input 22 treesize of output 27 [2022-12-13 10:01:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:35,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:35,901 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:01:35,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 159 [2022-12-13 10:01:35,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:01:35,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 62 [2022-12-13 10:01:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:36,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291455321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:36,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:36,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:36,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641948455] [2022-12-13 10:01:36,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:36,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=142, Unknown=3, NotChecked=0, Total=182 [2022-12-13 10:01:36,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 80 [2022-12-13 10:01:36,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 353 transitions, 7101 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:36,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:36,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 80 [2022-12-13 10:01:36,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:36,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~i_BA~0 4))) (let ((.cse0 (+ c_~i_BA~0 1)) (.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse3 (select |c_#memory_int| c_~B~0.base)) (.cse4 (+ c_~A~0.offset .cse2 4)) (.cse5 (+ .cse2 4 c_~B~0.offset))) (and (< .cse0 c_~An~0) (< c_~i_BA~0 c_~An~0) (< c_~i_BA~0 c_~Bn~0) (= (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse3 (+ .cse2 c_~B~0.offset))) (< .cse0 c_~Bn~0) (= (select .cse1 .cse4) (select .cse3 .cse5)) (forall ((v_ArrVal_2298 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2298))) (= (select (select .cse6 c_~A~0.base) .cse4) (select (select .cse6 c_~B~0.base) .cse5))))))) is different from false [2022-12-13 10:01:37,697 INFO L130 PetriNetUnfolder]: 3455/6391 cut-off events. [2022-12-13 10:01:37,697 INFO L131 PetriNetUnfolder]: For 199314/199314 co-relation queries the response was YES. [2022-12-13 10:01:37,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54394 conditions, 6391 events. 3455/6391 cut-off events. For 199314/199314 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 48247 event pairs, 1105 based on Foata normal form. 36/6421 useless extension candidates. Maximal degree in co-relation 51875. Up to 5587 conditions per place. [2022-12-13 10:01:37,759 INFO L137 encePairwiseOnDemand]: 42/80 looper letters, 354 selfloop transitions, 83 changer transitions 9/446 dead transitions. [2022-12-13 10:01:37,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 446 transitions, 9121 flow [2022-12-13 10:01:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:01:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:01:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-12-13 10:01:37,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20875 [2022-12-13 10:01:37,760 INFO L175 Difference]: Start difference. First operand has 207 places, 353 transitions, 7101 flow. Second operand 10 states and 167 transitions. [2022-12-13 10:01:37,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 446 transitions, 9121 flow [2022-12-13 10:01:38,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 446 transitions, 8989 flow, removed 1 selfloop flow, removed 9 redundant places. [2022-12-13 10:01:38,604 INFO L231 Difference]: Finished difference. Result has 211 places, 383 transitions, 7802 flow [2022-12-13 10:01:38,604 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=6975, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7802, PETRI_PLACES=211, PETRI_TRANSITIONS=383} [2022-12-13 10:01:38,605 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-13 10:01:38,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:38,605 INFO L89 Accepts]: Start accepts. Operand has 211 places, 383 transitions, 7802 flow [2022-12-13 10:01:38,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:38,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:38,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 383 transitions, 7802 flow [2022-12-13 10:01:38,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 383 transitions, 7802 flow [2022-12-13 10:01:38,924 INFO L130 PetriNetUnfolder]: 707/2442 cut-off events. [2022-12-13 10:01:38,924 INFO L131 PetriNetUnfolder]: For 57425/57551 co-relation queries the response was YES. [2022-12-13 10:01:38,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17261 conditions, 2442 events. 707/2442 cut-off events. For 57425/57551 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 25444 event pairs, 243 based on Foata normal form. 24/2273 useless extension candidates. Maximal degree in co-relation 16415. Up to 515 conditions per place. [2022-12-13 10:01:38,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 383 transitions, 7802 flow [2022-12-13 10:01:38,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 1856 [2022-12-13 10:01:38,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L47-5-->L47-5: Formula: (let ((.cse3 (select |v_#memory_int_462| v_~B~0.base_236)) (.cse1 (select |v_#memory_int_462| v_~A~0.base_244)) (.cse2 (* v_~i_AB~0_348 4)) (.cse0 (+ v_~i_AB~0_348 1))) (and (< .cse0 v_~Bn~0_244) (= (select .cse1 (+ .cse2 v_~A~0.offset_244)) (select .cse3 (+ v_~B~0.offset_236 .cse2))) (= v_~i_AB~0_346 (+ 2 v_~i_AB~0_348)) (= (select .cse3 (+ v_~B~0.offset_236 .cse2 4)) (select .cse1 (+ .cse2 v_~A~0.offset_244 4))) (< .cse0 v_~An~0_220))) InVars {~A~0.base=v_~A~0.base_244, ~B~0.base=v_~B~0.base_236, ~A~0.offset=v_~A~0.offset_244, ~i_AB~0=v_~i_AB~0_348, #memory_int=|v_#memory_int_462|, ~B~0.offset=v_~B~0.offset_236, ~Bn~0=v_~Bn~0_244, ~An~0=v_~An~0_220} OutVars{~A~0.base=v_~A~0.base_244, ~B~0.base=v_~B~0.base_236, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_320|, ~A~0.offset=v_~A~0.offset_244, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_178|, ~i_AB~0=v_~i_AB~0_346, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_134|, #memory_int=|v_#memory_int_462|, ~B~0.offset=v_~B~0.offset_236, ~Bn~0=v_~Bn~0_244, ~An~0=v_~An~0_220} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:01:39,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [654] L47-5-->L47-5: Formula: (let ((.cse3 (select |v_#memory_int_462| v_~B~0.base_236)) (.cse1 (select |v_#memory_int_462| v_~A~0.base_244)) (.cse2 (* v_~i_AB~0_348 4)) (.cse0 (+ v_~i_AB~0_348 1))) (and (< .cse0 v_~Bn~0_244) (= (select .cse1 (+ .cse2 v_~A~0.offset_244)) (select .cse3 (+ v_~B~0.offset_236 .cse2))) (= v_~i_AB~0_346 (+ 2 v_~i_AB~0_348)) (= (select .cse3 (+ v_~B~0.offset_236 .cse2 4)) (select .cse1 (+ .cse2 v_~A~0.offset_244 4))) (< .cse0 v_~An~0_220))) InVars {~A~0.base=v_~A~0.base_244, ~B~0.base=v_~B~0.base_236, ~A~0.offset=v_~A~0.offset_244, ~i_AB~0=v_~i_AB~0_348, #memory_int=|v_#memory_int_462|, ~B~0.offset=v_~B~0.offset_236, ~Bn~0=v_~Bn~0_244, ~An~0=v_~An~0_220} OutVars{~A~0.base=v_~A~0.base_244, ~B~0.base=v_~B~0.base_236, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_320|, ~A~0.offset=v_~A~0.offset_244, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_178|, ~i_AB~0=v_~i_AB~0_346, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_134|, #memory_int=|v_#memory_int_462|, ~B~0.offset=v_~B~0.offset_236, ~Bn~0=v_~Bn~0_244, ~An~0=v_~An~0_220} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:01:39,066 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:01:39,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-13 10:01:39,067 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 383 transitions, 7848 flow [2022-12-13 10:01:39,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:39,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:39,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:39,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:39,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 10:01:39,272 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash -794443617, now seen corresponding path program 1 times [2022-12-13 10:01:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:39,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854382306] [2022-12-13 10:01:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:39,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854382306] [2022-12-13 10:01:39,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854382306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:39,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730035573] [2022-12-13 10:01:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:39,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:39,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:39,372 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:39,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 10:01:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:39,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:01:39,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:39,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:39,593 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-13 10:01:39,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730035573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:39,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:39,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2022-12-13 10:01:39,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6070157] [2022-12-13 10:01:39,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:39,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:01:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:01:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:01:39,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-13 10:01:39,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 383 transitions, 7848 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:39,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:39,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-13 10:01:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:41,247 INFO L130 PetriNetUnfolder]: 3848/7176 cut-off events. [2022-12-13 10:01:41,247 INFO L131 PetriNetUnfolder]: For 256258/256258 co-relation queries the response was YES. [2022-12-13 10:01:41,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65750 conditions, 7176 events. 3848/7176 cut-off events. For 256258/256258 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 56187 event pairs, 808 based on Foata normal form. 6/7176 useless extension candidates. Maximal degree in co-relation 62224. Up to 4409 conditions per place. [2022-12-13 10:01:41,314 INFO L137 encePairwiseOnDemand]: 21/82 looper letters, 216 selfloop transitions, 240 changer transitions 2/458 dead transitions. [2022-12-13 10:01:41,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 458 transitions, 9896 flow [2022-12-13 10:01:41,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:01:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:01:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2022-12-13 10:01:41,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2005420054200542 [2022-12-13 10:01:41,315 INFO L175 Difference]: Start difference. First operand has 211 places, 383 transitions, 7848 flow. Second operand 9 states and 148 transitions. [2022-12-13 10:01:41,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 458 transitions, 9896 flow [2022-12-13 10:01:42,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 458 transitions, 9740 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 10:01:42,192 INFO L231 Difference]: Finished difference. Result has 220 places, 406 transitions, 9003 flow [2022-12-13 10:01:42,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=7694, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9003, PETRI_PLACES=220, PETRI_TRANSITIONS=406} [2022-12-13 10:01:42,192 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 199 predicate places. [2022-12-13 10:01:42,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:42,192 INFO L89 Accepts]: Start accepts. Operand has 220 places, 406 transitions, 9003 flow [2022-12-13 10:01:42,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:42,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:42,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 406 transitions, 9003 flow [2022-12-13 10:01:42,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 406 transitions, 9003 flow [2022-12-13 10:01:42,517 INFO L130 PetriNetUnfolder]: 768/2719 cut-off events. [2022-12-13 10:01:42,518 INFO L131 PetriNetUnfolder]: For 73244/73389 co-relation queries the response was YES. [2022-12-13 10:01:42,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20386 conditions, 2719 events. 768/2719 cut-off events. For 73244/73389 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 29262 event pairs, 280 based on Foata normal form. 24/2534 useless extension candidates. Maximal degree in co-relation 19090. Up to 544 conditions per place. [2022-12-13 10:01:42,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 406 transitions, 9003 flow [2022-12-13 10:01:42,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 1976 [2022-12-13 10:01:42,560 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:01:42,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-13 10:01:42,560 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 406 transitions, 9003 flow [2022-12-13 10:01:42,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:42,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:42,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:42,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:42,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 10:01:42,766 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -12314473, now seen corresponding path program 1 times [2022-12-13 10:01:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:42,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321004943] [2022-12-13 10:01:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:42,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:42,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321004943] [2022-12-13 10:01:42,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321004943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:42,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100572817] [2022-12-13 10:01:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:42,807 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:42,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 10:01:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:42,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 10:01:42,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:42,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:01:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100572817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:01:42,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:01:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:01:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102766632] [2022-12-13 10:01:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:01:42,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:01:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:01:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:01:42,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-13 10:01:42,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 406 transitions, 9003 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:42,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:42,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-13 10:01:42,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:44,617 INFO L130 PetriNetUnfolder]: 3545/6686 cut-off events. [2022-12-13 10:01:44,618 INFO L131 PetriNetUnfolder]: For 280043/280043 co-relation queries the response was YES. [2022-12-13 10:01:44,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64845 conditions, 6686 events. 3545/6686 cut-off events. For 280043/280043 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 51714 event pairs, 2020 based on Foata normal form. 86/6765 useless extension candidates. Maximal degree in co-relation 63305. Up to 3733 conditions per place. [2022-12-13 10:01:44,678 INFO L137 encePairwiseOnDemand]: 66/82 looper letters, 401 selfloop transitions, 9 changer transitions 16/426 dead transitions. [2022-12-13 10:01:44,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 426 transitions, 10018 flow [2022-12-13 10:01:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:01:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:01:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-12-13 10:01:44,679 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2022-12-13 10:01:44,679 INFO L175 Difference]: Start difference. First operand has 220 places, 406 transitions, 9003 flow. Second operand 4 states and 126 transitions. [2022-12-13 10:01:44,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 426 transitions, 10018 flow [2022-12-13 10:01:45,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 426 transitions, 9345 flow, removed 145 selfloop flow, removed 10 redundant places. [2022-12-13 10:01:45,623 INFO L231 Difference]: Finished difference. Result has 214 places, 344 transitions, 7163 flow [2022-12-13 10:01:45,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=7516, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7163, PETRI_PLACES=214, PETRI_TRANSITIONS=344} [2022-12-13 10:01:45,623 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 193 predicate places. [2022-12-13 10:01:45,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:45,623 INFO L89 Accepts]: Start accepts. Operand has 214 places, 344 transitions, 7163 flow [2022-12-13 10:01:45,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:45,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:45,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 344 transitions, 7163 flow [2022-12-13 10:01:45,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 344 transitions, 7163 flow [2022-12-13 10:01:45,883 INFO L130 PetriNetUnfolder]: 637/2334 cut-off events. [2022-12-13 10:01:45,883 INFO L131 PetriNetUnfolder]: For 59939/60105 co-relation queries the response was YES. [2022-12-13 10:01:45,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17068 conditions, 2334 events. 637/2334 cut-off events. For 59939/60105 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 24471 event pairs, 231 based on Foata normal form. 20/2156 useless extension candidates. Maximal degree in co-relation 16729. Up to 450 conditions per place. [2022-12-13 10:01:45,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 344 transitions, 7163 flow [2022-12-13 10:01:45,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 1536 [2022-12-13 10:01:45,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L47-5-->L47-5: Formula: (let ((.cse2 (select |v_#memory_int_289| v_~A~0.base_131)) (.cse0 (select |v_#memory_int_289| v_~B~0.base_119))) (and (let ((.cse1 (* v_~i_AB~0_154 4))) (= (select .cse0 (+ v_~B~0.offset_119 (- 4) .cse1)) (select .cse2 (+ v_~A~0.offset_131 (- 4) .cse1)))) (= v_~i_AB~0_154 (+ 2 v_~i_AB~0_156)) (let ((.cse3 (* 4 v_~i_BA~0_137))) (= (select .cse0 (+ .cse3 v_~B~0.offset_119)) (select .cse2 (+ .cse3 v_~A~0.offset_131)))) (< v_~i_BA~0_137 v_~Bn~0_136) (< v_~i_AB~0_154 (+ v_~An~0_112 1)) (= (+ v_~i_BA~0_137 1) v_~i_BA~0_136) (< v_~i_BA~0_137 v_~An~0_112) (< v_~i_AB~0_154 (+ v_~Bn~0_136 1)) (let ((.cse4 (* v_~i_AB~0_156 4))) (= (select .cse2 (+ .cse4 v_~A~0.offset_131)) (select .cse0 (+ .cse4 v_~B~0.offset_119)))))) InVars {~A~0.base=v_~A~0.base_131, ~B~0.base=v_~B~0.base_119, ~A~0.offset=v_~A~0.offset_131, ~i_AB~0=v_~i_AB~0_156, #memory_int=|v_#memory_int_289|, ~i_BA~0=v_~i_BA~0_137, ~B~0.offset=v_~B~0.offset_119, ~Bn~0=v_~Bn~0_136, ~An~0=v_~An~0_112} OutVars{~A~0.base=v_~A~0.base_131, ~B~0.base=v_~B~0.base_119, ~i_AB~0=v_~i_AB~0_154, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_61|, ~An~0=v_~An~0_112, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_51|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_130|, ~A~0.offset=v_~A~0.offset_131, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_90|, #memory_int=|v_#memory_int_289|, ~i_BA~0=v_~i_BA~0_136, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_95|, ~B~0.offset=v_~B~0.offset_119, ~Bn~0=v_~Bn~0_136, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_97|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:01:46,219 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:01:46,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 597 [2022-12-13 10:01:46,220 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 344 transitions, 7220 flow [2022-12-13 10:01:46,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:46,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:46,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:46,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-13 10:01:46,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:46,426 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash 665143536, now seen corresponding path program 1 times [2022-12-13 10:01:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:46,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846301784] [2022-12-13 10:01:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:46,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846301784] [2022-12-13 10:01:46,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846301784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:46,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738757713] [2022-12-13 10:01:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:46,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:46,671 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:46,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 10:01:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:46,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:01:46,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:46,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:46,992 INFO L321 Elim1Store]: treesize reduction 11, result has 87.9 percent of original size [2022-12-13 10:01:46,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 98 [2022-12-13 10:01:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:47,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738757713] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:47,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:47,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 10:01:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930163754] [2022-12-13 10:01:47,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:47,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:01:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:01:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:01:47,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-13 10:01:47,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 344 transitions, 7220 flow. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:47,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:47,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-13 10:01:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:49,141 INFO L130 PetriNetUnfolder]: 3642/6825 cut-off events. [2022-12-13 10:01:49,141 INFO L131 PetriNetUnfolder]: For 274911/274911 co-relation queries the response was YES. [2022-12-13 10:01:49,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63955 conditions, 6825 events. 3642/6825 cut-off events. For 274911/274911 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 52884 event pairs, 1192 based on Foata normal form. 72/6891 useless extension candidates. Maximal degree in co-relation 62637. Up to 5521 conditions per place. [2022-12-13 10:01:49,220 INFO L137 encePairwiseOnDemand]: 25/78 looper letters, 287 selfloop transitions, 148 changer transitions 2/437 dead transitions. [2022-12-13 10:01:49,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 437 transitions, 9091 flow [2022-12-13 10:01:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:01:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:01:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 174 transitions. [2022-12-13 10:01:49,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13942307692307693 [2022-12-13 10:01:49,221 INFO L175 Difference]: Start difference. First operand has 208 places, 344 transitions, 7220 flow. Second operand 16 states and 174 transitions. [2022-12-13 10:01:49,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 437 transitions, 9091 flow [2022-12-13 10:01:50,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 437 transitions, 8926 flow, removed 37 selfloop flow, removed 6 redundant places. [2022-12-13 10:01:50,242 INFO L231 Difference]: Finished difference. Result has 220 places, 355 transitions, 7631 flow [2022-12-13 10:01:50,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=7067, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7631, PETRI_PLACES=220, PETRI_TRANSITIONS=355} [2022-12-13 10:01:50,242 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 199 predicate places. [2022-12-13 10:01:50,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:50,242 INFO L89 Accepts]: Start accepts. Operand has 220 places, 355 transitions, 7631 flow [2022-12-13 10:01:50,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:50,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:50,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 355 transitions, 7631 flow [2022-12-13 10:01:50,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 355 transitions, 7631 flow [2022-12-13 10:01:50,485 INFO L130 PetriNetUnfolder]: 593/2145 cut-off events. [2022-12-13 10:01:50,485 INFO L131 PetriNetUnfolder]: For 55008/55120 co-relation queries the response was YES. [2022-12-13 10:01:50,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15694 conditions, 2145 events. 593/2145 cut-off events. For 55008/55120 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 22157 event pairs, 214 based on Foata normal form. 13/1980 useless extension candidates. Maximal degree in co-relation 15351. Up to 446 conditions per place. [2022-12-13 10:01:50,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 355 transitions, 7631 flow [2022-12-13 10:01:50,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 1636 [2022-12-13 10:01:50,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [606] L47-5-->L47-5: Formula: (let ((.cse3 (+ v_~i_AB~0_169 1)) (.cse0 (select |v_#memory_int_300| v_~A~0.base_139)) (.cse2 (select |v_#memory_int_300| v_~B~0.base_125)) (.cse1 (* v_~i_AB~0_169 4))) (and (= (+ 2 v_~i_AB~0_169) v_~i_AB~0_167) (< v_~i_BA~0_149 v_~An~0_120) (= (select .cse0 (+ .cse1 v_~A~0.offset_139 4)) (select .cse2 (+ .cse1 v_~B~0.offset_125 4))) (< .cse3 v_~Bn~0_144) (let ((.cse4 (* 4 v_~i_BA~0_149))) (= (select .cse0 (+ v_~A~0.offset_139 .cse4)) (select .cse2 (+ v_~B~0.offset_125 .cse4)))) (< .cse3 v_~An~0_120) (= v_~i_BA~0_148 (+ v_~i_BA~0_149 1)) (= (select .cse0 (+ .cse1 v_~A~0.offset_139)) (select .cse2 (+ .cse1 v_~B~0.offset_125))) (< v_~i_BA~0_149 v_~Bn~0_144))) InVars {~A~0.base=v_~A~0.base_139, ~B~0.base=v_~B~0.base_125, ~A~0.offset=v_~A~0.offset_139, ~i_AB~0=v_~i_AB~0_169, #memory_int=|v_#memory_int_300|, ~i_BA~0=v_~i_BA~0_149, ~B~0.offset=v_~B~0.offset_125, ~Bn~0=v_~Bn~0_144, ~An~0=v_~An~0_120} OutVars{~A~0.base=v_~A~0.base_139, ~B~0.base=v_~B~0.base_125, ~i_AB~0=v_~i_AB~0_167, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_67|, ~An~0=v_~An~0_120, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_57|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_141|, ~A~0.offset=v_~A~0.offset_139, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_96|, #memory_int=|v_#memory_int_300|, ~i_BA~0=v_~i_BA~0_148, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_101|, ~B~0.offset=v_~B~0.offset_125, ~Bn~0=v_~Bn~0_144, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_103|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:01:55,875 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:01:55,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5633 [2022-12-13 10:01:55,875 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 355 transitions, 7729 flow [2022-12-13 10:01:55,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:55,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:55,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:55,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 10:01:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 10:01:56,076 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:01:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:01:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -971544735, now seen corresponding path program 1 times [2022-12-13 10:01:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:01:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161768782] [2022-12-13 10:01:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:01:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:01:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161768782] [2022-12-13 10:01:56,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161768782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:01:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520519232] [2022-12-13 10:01:56,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:01:56,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:01:56,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:01:56,305 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:01:56,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 10:01:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:01:56,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:01:56,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:01:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:56,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:01:56,592 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:01:56,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 88 [2022-12-13 10:01:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:01:56,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520519232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:01:56,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:01:56,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:01:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41683097] [2022-12-13 10:01:56,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:01:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:01:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:01:56,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:01:56,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:01:56,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-13 10:01:56,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 355 transitions, 7729 flow. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:56,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:01:56,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-13 10:01:56,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:01:58,168 INFO L130 PetriNetUnfolder]: 3199/5999 cut-off events. [2022-12-13 10:01:58,168 INFO L131 PetriNetUnfolder]: For 240057/240057 co-relation queries the response was YES. [2022-12-13 10:01:58,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57434 conditions, 5999 events. 3199/5999 cut-off events. For 240057/240057 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 45710 event pairs, 1246 based on Foata normal form. 6/5999 useless extension candidates. Maximal degree in co-relation 56107. Up to 5742 conditions per place. [2022-12-13 10:01:58,224 INFO L137 encePairwiseOnDemand]: 44/79 looper letters, 326 selfloop transitions, 88 changer transitions 6/420 dead transitions. [2022-12-13 10:01:58,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 420 transitions, 9845 flow [2022-12-13 10:01:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:01:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:01:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 148 transitions. [2022-12-13 10:01:58,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14410905550146055 [2022-12-13 10:01:58,225 INFO L175 Difference]: Start difference. First operand has 219 places, 355 transitions, 7729 flow. Second operand 13 states and 148 transitions. [2022-12-13 10:01:58,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 420 transitions, 9845 flow [2022-12-13 10:01:58,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 420 transitions, 9405 flow, removed 88 selfloop flow, removed 11 redundant places. [2022-12-13 10:01:58,963 INFO L231 Difference]: Finished difference. Result has 225 places, 391 transitions, 8642 flow [2022-12-13 10:01:58,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=7356, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8642, PETRI_PLACES=225, PETRI_TRANSITIONS=391} [2022-12-13 10:01:58,964 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 204 predicate places. [2022-12-13 10:01:58,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:01:58,964 INFO L89 Accepts]: Start accepts. Operand has 225 places, 391 transitions, 8642 flow [2022-12-13 10:01:58,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:01:58,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:01:58,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 391 transitions, 8642 flow [2022-12-13 10:01:58,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 391 transitions, 8642 flow [2022-12-13 10:01:59,226 INFO L130 PetriNetUnfolder]: 639/2283 cut-off events. [2022-12-13 10:01:59,226 INFO L131 PetriNetUnfolder]: For 60245/60351 co-relation queries the response was YES. [2022-12-13 10:01:59,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16887 conditions, 2283 events. 639/2283 cut-off events. For 60245/60351 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 23635 event pairs, 211 based on Foata normal form. 17/2124 useless extension candidates. Maximal degree in co-relation 16535. Up to 482 conditions per place. [2022-12-13 10:01:59,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 391 transitions, 8642 flow [2022-12-13 10:01:59,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 1696 [2022-12-13 10:01:59,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:59,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:59,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:59,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:59,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:01:59,926 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:01:59,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 963 [2022-12-13 10:01:59,927 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 390 transitions, 8804 flow [2022-12-13 10:01:59,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:01:59,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:01:59,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:01:59,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:00,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-13 10:02:00,132 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1236555386, now seen corresponding path program 1 times [2022-12-13 10:02:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:00,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858527827] [2022-12-13 10:02:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:00,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858527827] [2022-12-13 10:02:00,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858527827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:00,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876110244] [2022-12-13 10:02:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:00,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:00,175 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:00,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 10:02:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:00,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:02:00,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:00,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:02:00,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876110244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:02:00,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:02:00,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:02:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752674391] [2022-12-13 10:02:00,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:02:00,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:02:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:02:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:02:00,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 10:02:00,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 390 transitions, 8804 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:00,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:00,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 10:02:00,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:01,871 INFO L130 PetriNetUnfolder]: 4238/7942 cut-off events. [2022-12-13 10:02:01,871 INFO L131 PetriNetUnfolder]: For 341631/341631 co-relation queries the response was YES. [2022-12-13 10:02:01,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76512 conditions, 7942 events. 4238/7942 cut-off events. For 341631/341631 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 62889 event pairs, 2200 based on Foata normal form. 84/8019 useless extension candidates. Maximal degree in co-relation 75161. Up to 4252 conditions per place. [2022-12-13 10:02:01,962 INFO L137 encePairwiseOnDemand]: 76/84 looper letters, 495 selfloop transitions, 8 changer transitions 5/508 dead transitions. [2022-12-13 10:02:01,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 508 transitions, 11815 flow [2022-12-13 10:02:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:02:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:02:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-12-13 10:02:01,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3898809523809524 [2022-12-13 10:02:01,963 INFO L175 Difference]: Start difference. First operand has 221 places, 390 transitions, 8804 flow. Second operand 4 states and 131 transitions. [2022-12-13 10:02:01,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 508 transitions, 11815 flow [2022-12-13 10:02:03,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 508 transitions, 11337 flow, removed 227 selfloop flow, removed 2 redundant places. [2022-12-13 10:02:03,463 INFO L231 Difference]: Finished difference. Result has 223 places, 387 transitions, 8471 flow [2022-12-13 10:02:03,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=8445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8471, PETRI_PLACES=223, PETRI_TRANSITIONS=387} [2022-12-13 10:02:03,464 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2022-12-13 10:02:03,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:03,464 INFO L89 Accepts]: Start accepts. Operand has 223 places, 387 transitions, 8471 flow [2022-12-13 10:02:03,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:03,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:03,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 387 transitions, 8471 flow [2022-12-13 10:02:03,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 387 transitions, 8471 flow [2022-12-13 10:02:03,920 INFO L130 PetriNetUnfolder]: 823/2974 cut-off events. [2022-12-13 10:02:03,920 INFO L131 PetriNetUnfolder]: For 78095/78237 co-relation queries the response was YES. [2022-12-13 10:02:03,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21616 conditions, 2974 events. 823/2974 cut-off events. For 78095/78237 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 32630 event pairs, 289 based on Foata normal form. 22/2760 useless extension candidates. Maximal degree in co-relation 21263. Up to 608 conditions per place. [2022-12-13 10:02:03,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 387 transitions, 8471 flow [2022-12-13 10:02:03,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 1688 [2022-12-13 10:02:03,966 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:02:03,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 502 [2022-12-13 10:02:03,966 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 387 transitions, 8471 flow [2022-12-13 10:02:03,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:03,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:03,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:03,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:04,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:04,169 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1277733353, now seen corresponding path program 1 times [2022-12-13 10:02:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:04,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930788633] [2022-12-13 10:02:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:04,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930788633] [2022-12-13 10:02:04,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930788633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:02:04,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:02:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:02:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263436741] [2022-12-13 10:02:04,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:02:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:02:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:02:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:02:04,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 10:02:04,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 387 transitions, 8471 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:04,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:04,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 10:02:04,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:05,632 INFO L130 PetriNetUnfolder]: 4145/7775 cut-off events. [2022-12-13 10:02:05,632 INFO L131 PetriNetUnfolder]: For 326476/326476 co-relation queries the response was YES. [2022-12-13 10:02:05,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74406 conditions, 7775 events. 4145/7775 cut-off events. For 326476/326476 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 61644 event pairs, 2252 based on Foata normal form. 4/7772 useless extension candidates. Maximal degree in co-relation 73400. Up to 7644 conditions per place. [2022-12-13 10:02:05,721 INFO L137 encePairwiseOnDemand]: 70/84 looper letters, 375 selfloop transitions, 22 changer transitions 0/397 dead transitions. [2022-12-13 10:02:05,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 397 transitions, 9368 flow [2022-12-13 10:02:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:02:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:02:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-12-13 10:02:05,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2022-12-13 10:02:05,722 INFO L175 Difference]: Start difference. First operand has 221 places, 387 transitions, 8471 flow. Second operand 3 states and 100 transitions. [2022-12-13 10:02:05,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 397 transitions, 9368 flow [2022-12-13 10:02:07,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 397 transitions, 9352 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 10:02:07,048 INFO L231 Difference]: Finished difference. Result has 222 places, 388 transitions, 8509 flow [2022-12-13 10:02:07,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=8343, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8509, PETRI_PLACES=222, PETRI_TRANSITIONS=388} [2022-12-13 10:02:07,049 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 201 predicate places. [2022-12-13 10:02:07,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:07,049 INFO L89 Accepts]: Start accepts. Operand has 222 places, 388 transitions, 8509 flow [2022-12-13 10:02:07,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:07,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:07,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 388 transitions, 8509 flow [2022-12-13 10:02:07,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 388 transitions, 8509 flow [2022-12-13 10:02:07,450 INFO L130 PetriNetUnfolder]: 801/2900 cut-off events. [2022-12-13 10:02:07,450 INFO L131 PetriNetUnfolder]: For 77558/77694 co-relation queries the response was YES. [2022-12-13 10:02:07,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21269 conditions, 2900 events. 801/2900 cut-off events. For 77558/77694 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 31674 event pairs, 284 based on Foata normal form. 22/2690 useless extension candidates. Maximal degree in co-relation 20920. Up to 590 conditions per place. [2022-12-13 10:02:07,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 388 transitions, 8509 flow [2022-12-13 10:02:07,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 1700 [2022-12-13 10:02:07,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] L47-5-->L59-5: Formula: (let ((.cse1 (* 4 v_~i_BA~0_375)) (.cse4 (+ v_~i_BA~0_375 1)) (.cse0 (select |v_#memory_int_549| v_~B~0.base_280)) (.cse2 (select |v_#memory_int_549| v_~A~0.base_285)) (.cse3 (* v_~i_AB~0_459 4))) (and (= (select .cse0 (+ v_~B~0.offset_280 .cse1 4)) (select .cse2 (+ v_~A~0.offset_285 .cse1 4))) (= (select .cse2 (+ v_~A~0.offset_285 .cse1)) (select .cse0 (+ v_~B~0.offset_280 .cse1))) (= v_~i_AB~0_458 (+ 2 v_~i_AB~0_459)) (= (select .cse0 (+ v_~B~0.offset_280 .cse3 4)) (select .cse2 (+ v_~A~0.offset_285 .cse3 4))) (< v_~i_AB~0_458 v_~Bn~0_284) (< v_~i_AB~0_458 v_~An~0_258) (< .cse4 v_~Bn~0_284) (= v_~i_BA~0_373 (+ 2 v_~i_BA~0_375)) (= (select .cse2 (+ (* v_~i_AB~0_458 4) v_~A~0.offset_285)) |v_thread1Thread1of1ForFork1_#t~mem1_408|) (< .cse4 v_~An~0_258) (= (select .cse0 (+ v_~B~0.offset_280 .cse3)) (select .cse2 (+ v_~A~0.offset_285 .cse3))))) InVars {~A~0.base=v_~A~0.base_285, ~B~0.base=v_~B~0.base_280, ~A~0.offset=v_~A~0.offset_285, ~i_AB~0=v_~i_AB~0_459, #memory_int=|v_#memory_int_549|, ~i_BA~0=v_~i_BA~0_375, ~B~0.offset=v_~B~0.offset_280, ~Bn~0=v_~Bn~0_284, ~An~0=v_~An~0_258} OutVars{~A~0.base=v_~A~0.base_285, ~B~0.base=v_~B~0.base_280, ~i_AB~0=v_~i_AB~0_458, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_210|, ~An~0=v_~An~0_258, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_189|, ~A~0.offset=v_~A~0.offset_285, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_408|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_259|, #memory_int=|v_#memory_int_549|, ~i_BA~0=v_~i_BA~0_373, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_262|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_264|, ~B~0.offset=v_~B~0.offset_280, ~Bn~0=v_~Bn~0_284} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:02:07,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:02:07,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 845 [2022-12-13 10:02:07,895 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 388 transitions, 8571 flow [2022-12-13 10:02:07,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:07,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:07,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:07,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 10:02:07,895 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 33036635, now seen corresponding path program 1 times [2022-12-13 10:02:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519959270] [2022-12-13 10:02:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:08,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519959270] [2022-12-13 10:02:08,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519959270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:08,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059465176] [2022-12-13 10:02:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:08,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:08,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:08,152 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:08,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 10:02:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:08,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:02:08,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:08,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:08,442 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:08,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:02:08,446 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:08,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:02:08,478 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:02:08,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:02:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:08,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059465176] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:08,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:08,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:02:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157243709] [2022-12-13 10:02:08,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:08,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:02:08,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:08,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:02:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:02:08,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-13 10:02:08,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 388 transitions, 8571 flow. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:08,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:08,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-13 10:02:08,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:10,263 INFO L130 PetriNetUnfolder]: 4137/7767 cut-off events. [2022-12-13 10:02:10,264 INFO L131 PetriNetUnfolder]: For 328242/328242 co-relation queries the response was YES. [2022-12-13 10:02:10,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74472 conditions, 7767 events. 4137/7767 cut-off events. For 328242/328242 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 61719 event pairs, 2172 based on Foata normal form. 6/7766 useless extension candidates. Maximal degree in co-relation 73115. Up to 7693 conditions per place. [2022-12-13 10:02:10,335 INFO L137 encePairwiseOnDemand]: 48/85 looper letters, 329 selfloop transitions, 77 changer transitions 1/407 dead transitions. [2022-12-13 10:02:10,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 407 transitions, 9388 flow [2022-12-13 10:02:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:02:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:02:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2022-12-13 10:02:10,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15401069518716579 [2022-12-13 10:02:10,336 INFO L175 Difference]: Start difference. First operand has 222 places, 388 transitions, 8571 flow. Second operand 11 states and 144 transitions. [2022-12-13 10:02:10,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 407 transitions, 9388 flow [2022-12-13 10:02:11,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 407 transitions, 9341 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:02:11,389 INFO L231 Difference]: Finished difference. Result has 230 places, 385 transitions, 8533 flow [2022-12-13 10:02:11,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=8391, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8533, PETRI_PLACES=230, PETRI_TRANSITIONS=385} [2022-12-13 10:02:11,390 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 209 predicate places. [2022-12-13 10:02:11,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:11,390 INFO L89 Accepts]: Start accepts. Operand has 230 places, 385 transitions, 8533 flow [2022-12-13 10:02:11,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:11,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:11,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 385 transitions, 8533 flow [2022-12-13 10:02:11,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 385 transitions, 8533 flow [2022-12-13 10:02:11,676 INFO L130 PetriNetUnfolder]: 651/2365 cut-off events. [2022-12-13 10:02:11,676 INFO L131 PetriNetUnfolder]: For 63194/63319 co-relation queries the response was YES. [2022-12-13 10:02:11,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17525 conditions, 2365 events. 651/2365 cut-off events. For 63194/63319 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24742 event pairs, 229 based on Foata normal form. 19/2194 useless extension candidates. Maximal degree in co-relation 17425. Up to 488 conditions per place. [2022-12-13 10:02:11,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 385 transitions, 8533 flow [2022-12-13 10:02:11,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 1694 [2022-12-13 10:02:11,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [659] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_478| v_~A~0.base_254)) (.cse0 (select |v_#memory_int_478| v_~B~0.base_246))) (and (= v_~i_AB~0_368 (+ v_~i_AB~0_369 1)) (< v_~i_BA~0_295 v_~Bn~0_254) (let ((.cse1 (* v_~i_AB~0_369 4))) (= (select .cse0 (+ v_~B~0.offset_246 .cse1)) (select .cse2 (+ v_~A~0.offset_254 .cse1)))) (< v_~i_AB~0_369 v_~An~0_230) (let ((.cse3 (* 4 v_~i_BA~0_295))) (= (select .cse2 (+ .cse3 v_~A~0.offset_254)) (select .cse0 (+ .cse3 v_~B~0.offset_246)))) (< v_~i_BA~0_295 v_~An~0_230) (< v_~i_AB~0_369 v_~Bn~0_254) (= (+ v_~i_BA~0_295 1) v_~i_BA~0_294))) InVars {~A~0.base=v_~A~0.base_254, ~A~0.offset=v_~A~0.offset_254, ~B~0.base=v_~B~0.base_246, #memory_int=|v_#memory_int_478|, ~i_AB~0=v_~i_AB~0_369, ~i_BA~0=v_~i_BA~0_295, ~B~0.offset=v_~B~0.offset_246, ~Bn~0=v_~Bn~0_254, ~An~0=v_~An~0_230} OutVars{~A~0.base=v_~A~0.base_254, ~B~0.base=v_~B~0.base_246, ~i_AB~0=v_~i_AB~0_368, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_146|, ~An~0=v_~An~0_230, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_131|, ~A~0.offset=v_~A~0.offset_254, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_338|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_192|, #memory_int=|v_#memory_int_478|, ~i_BA~0=v_~i_BA~0_294, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_185|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_187|, ~B~0.offset=v_~B~0.offset_246, ~Bn~0=v_~Bn~0_254} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:02:11,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_456| v_~A~0.base_240)) (.cse2 (select |v_#memory_int_456| v_~B~0.base_232))) (and (= v_~i_AB~0_338 (+ v_~i_AB~0_339 1)) (= (+ v_~i_BA~0_287 1) v_~i_BA~0_286) (let ((.cse1 (* v_~i_AB~0_339 4))) (= (select .cse0 (+ v_~A~0.offset_240 .cse1)) (select .cse2 (+ v_~B~0.offset_232 .cse1)))) (< v_~i_BA~0_287 v_~An~0_216) (let ((.cse3 (* 4 v_~i_BA~0_287))) (= (select .cse0 (+ .cse3 v_~A~0.offset_240)) (select .cse2 (+ .cse3 v_~B~0.offset_232)))) (< v_~i_AB~0_339 v_~Bn~0_240) (< v_~i_AB~0_339 v_~An~0_216) (< v_~i_BA~0_287 v_~Bn~0_240))) InVars {~A~0.base=v_~A~0.base_240, ~A~0.offset=v_~A~0.offset_240, ~B~0.base=v_~B~0.base_232, #memory_int=|v_#memory_int_456|, ~i_AB~0=v_~i_AB~0_339, ~i_BA~0=v_~i_BA~0_287, ~B~0.offset=v_~B~0.offset_232, ~Bn~0=v_~Bn~0_240, ~An~0=v_~An~0_216} OutVars{~A~0.base=v_~A~0.base_240, ~B~0.base=v_~B~0.base_232, ~i_AB~0=v_~i_AB~0_338, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_130|, ~An~0=v_~An~0_216, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_127|, ~A~0.offset=v_~A~0.offset_240, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_314|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_172|, #memory_int=|v_#memory_int_456|, ~i_BA~0=v_~i_BA~0_286, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_181|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_183|, ~B~0.offset=v_~B~0.offset_232, ~Bn~0=v_~Bn~0_240} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:02:12,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [659] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_478| v_~A~0.base_254)) (.cse0 (select |v_#memory_int_478| v_~B~0.base_246))) (and (= v_~i_AB~0_368 (+ v_~i_AB~0_369 1)) (< v_~i_BA~0_295 v_~Bn~0_254) (let ((.cse1 (* v_~i_AB~0_369 4))) (= (select .cse0 (+ v_~B~0.offset_246 .cse1)) (select .cse2 (+ v_~A~0.offset_254 .cse1)))) (< v_~i_AB~0_369 v_~An~0_230) (let ((.cse3 (* 4 v_~i_BA~0_295))) (= (select .cse2 (+ .cse3 v_~A~0.offset_254)) (select .cse0 (+ .cse3 v_~B~0.offset_246)))) (< v_~i_BA~0_295 v_~An~0_230) (< v_~i_AB~0_369 v_~Bn~0_254) (= (+ v_~i_BA~0_295 1) v_~i_BA~0_294))) InVars {~A~0.base=v_~A~0.base_254, ~A~0.offset=v_~A~0.offset_254, ~B~0.base=v_~B~0.base_246, #memory_int=|v_#memory_int_478|, ~i_AB~0=v_~i_AB~0_369, ~i_BA~0=v_~i_BA~0_295, ~B~0.offset=v_~B~0.offset_246, ~Bn~0=v_~Bn~0_254, ~An~0=v_~An~0_230} OutVars{~A~0.base=v_~A~0.base_254, ~B~0.base=v_~B~0.base_246, ~i_AB~0=v_~i_AB~0_368, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_146|, ~An~0=v_~An~0_230, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_131|, ~A~0.offset=v_~A~0.offset_254, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_338|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_192|, #memory_int=|v_#memory_int_478|, ~i_BA~0=v_~i_BA~0_294, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_185|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_187|, ~B~0.offset=v_~B~0.offset_246, ~Bn~0=v_~Bn~0_254} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:02:12,181 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:02:12,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 791 [2022-12-13 10:02:12,181 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 385 transitions, 8707 flow [2022-12-13 10:02:12,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:12,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:12,181 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:12,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:12,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 10:02:12,382 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -449213695, now seen corresponding path program 1 times [2022-12-13 10:02:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:12,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771494598] [2022-12-13 10:02:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:12,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771494598] [2022-12-13 10:02:12,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771494598] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:12,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937857751] [2022-12-13 10:02:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:12,631 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:12,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 10:02:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:12,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:02:12,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:12,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:12,997 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:12,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:02:13,030 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:02:13,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:02:13,048 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:13,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:02:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:13,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937857751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:13,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:13,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:02:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154071501] [2022-12-13 10:02:13,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:13,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:02:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:02:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:02:13,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-13 10:02:13,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 385 transitions, 8707 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:13,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:13,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-13 10:02:13,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:14,713 INFO L130 PetriNetUnfolder]: 3421/6452 cut-off events. [2022-12-13 10:02:14,713 INFO L131 PetriNetUnfolder]: For 271069/271069 co-relation queries the response was YES. [2022-12-13 10:02:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62092 conditions, 6452 events. 3421/6452 cut-off events. For 271069/271069 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 49840 event pairs, 1242 based on Foata normal form. 4/6448 useless extension candidates. Maximal degree in co-relation 61981. Up to 6283 conditions per place. [2022-12-13 10:02:14,781 INFO L137 encePairwiseOnDemand]: 33/87 looper letters, 322 selfloop transitions, 118 changer transitions 7/447 dead transitions. [2022-12-13 10:02:14,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 447 transitions, 10388 flow [2022-12-13 10:02:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:02:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:02:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 171 transitions. [2022-12-13 10:02:14,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15119363395225463 [2022-12-13 10:02:14,782 INFO L175 Difference]: Start difference. First operand has 229 places, 385 transitions, 8707 flow. Second operand 13 states and 171 transitions. [2022-12-13 10:02:14,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 447 transitions, 10388 flow [2022-12-13 10:02:15,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 447 transitions, 10143 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-12-13 10:02:15,716 INFO L231 Difference]: Finished difference. Result has 238 places, 404 transitions, 9107 flow [2022-12-13 10:02:15,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=8462, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9107, PETRI_PLACES=238, PETRI_TRANSITIONS=404} [2022-12-13 10:02:15,717 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2022-12-13 10:02:15,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:15,717 INFO L89 Accepts]: Start accepts. Operand has 238 places, 404 transitions, 9107 flow [2022-12-13 10:02:15,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:15,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:15,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 404 transitions, 9107 flow [2022-12-13 10:02:15,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 404 transitions, 9107 flow [2022-12-13 10:02:16,099 INFO L130 PetriNetUnfolder]: 675/2425 cut-off events. [2022-12-13 10:02:16,099 INFO L131 PetriNetUnfolder]: For 70804/70933 co-relation queries the response was YES. [2022-12-13 10:02:16,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18464 conditions, 2425 events. 675/2425 cut-off events. For 70804/70933 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25312 event pairs, 231 based on Foata normal form. 21/2257 useless extension candidates. Maximal degree in co-relation 18341. Up to 504 conditions per place. [2022-12-13 10:02:16,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 404 transitions, 9107 flow [2022-12-13 10:02:16,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 1752 [2022-12-13 10:02:16,135 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:02:16,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-13 10:02:16,135 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 404 transitions, 9107 flow [2022-12-13 10:02:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:16,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:16,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:16,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:16,339 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1824008836, now seen corresponding path program 1 times [2022-12-13 10:02:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545649566] [2022-12-13 10:02:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545649566] [2022-12-13 10:02:16,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545649566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913103612] [2022-12-13 10:02:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:16,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:16,561 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:16,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 10:02:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:16,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:02:16,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:16,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:16,902 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:02:16,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 60 [2022-12-13 10:02:16,914 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:16,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 4 [2022-12-13 10:02:16,918 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:16,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 4 [2022-12-13 10:02:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:16,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913103612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:16,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:16,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:02:16,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206903294] [2022-12-13 10:02:16,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:16,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:02:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:02:16,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:02:16,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-13 10:02:16,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 404 transitions, 9107 flow. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:16,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:16,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-13 10:02:16,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:18,838 INFO L130 PetriNetUnfolder]: 3759/7054 cut-off events. [2022-12-13 10:02:18,839 INFO L131 PetriNetUnfolder]: For 345978/345978 co-relation queries the response was YES. [2022-12-13 10:02:18,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68328 conditions, 7054 events. 3759/7054 cut-off events. For 345978/345978 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 55223 event pairs, 1700 based on Foata normal form. 136/7182 useless extension candidates. Maximal degree in co-relation 68174. Up to 6453 conditions per place. [2022-12-13 10:02:18,914 INFO L137 encePairwiseOnDemand]: 41/85 looper letters, 364 selfloop transitions, 120 changer transitions 3/487 dead transitions. [2022-12-13 10:02:18,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 487 transitions, 11090 flow [2022-12-13 10:02:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:02:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:02:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2022-12-13 10:02:18,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19358288770053475 [2022-12-13 10:02:18,915 INFO L175 Difference]: Start difference. First operand has 233 places, 404 transitions, 9107 flow. Second operand 11 states and 181 transitions. [2022-12-13 10:02:18,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 487 transitions, 11090 flow [2022-12-13 10:02:19,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 487 transitions, 10864 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 10:02:19,898 INFO L231 Difference]: Finished difference. Result has 239 places, 434 transitions, 9764 flow [2022-12-13 10:02:19,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=8882, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9764, PETRI_PLACES=239, PETRI_TRANSITIONS=434} [2022-12-13 10:02:19,899 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 218 predicate places. [2022-12-13 10:02:19,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:19,899 INFO L89 Accepts]: Start accepts. Operand has 239 places, 434 transitions, 9764 flow [2022-12-13 10:02:19,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:19,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:19,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 434 transitions, 9764 flow [2022-12-13 10:02:19,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 434 transitions, 9764 flow [2022-12-13 10:02:20,237 INFO L130 PetriNetUnfolder]: 760/2728 cut-off events. [2022-12-13 10:02:20,237 INFO L131 PetriNetUnfolder]: For 85361/85512 co-relation queries the response was YES. [2022-12-13 10:02:20,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20632 conditions, 2728 events. 760/2728 cut-off events. For 85361/85512 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 29260 event pairs, 260 based on Foata normal form. 22/2530 useless extension candidates. Maximal degree in co-relation 20259. Up to 588 conditions per place. [2022-12-13 10:02:20,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 434 transitions, 9764 flow [2022-12-13 10:02:20,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 1974 [2022-12-13 10:02:20,281 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:02:20,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-13 10:02:20,282 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 434 transitions, 9764 flow [2022-12-13 10:02:20,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:20,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:20,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:20,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:20,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:20,482 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash 115511472, now seen corresponding path program 1 times [2022-12-13 10:02:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:20,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808143000] [2022-12-13 10:02:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:20,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808143000] [2022-12-13 10:02:20,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808143000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102317544] [2022-12-13 10:02:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:20,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:20,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:20,620 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:20,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 10:02:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:20,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 10:02:20,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:20,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:20,873 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:02:20,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 60 [2022-12-13 10:02:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:20,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102317544] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:20,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:20,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:02:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652933860] [2022-12-13 10:02:20,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:20,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:02:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:02:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:02:20,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-13 10:02:20,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 434 transitions, 9764 flow. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:20,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:20,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-13 10:02:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:23,037 INFO L130 PetriNetUnfolder]: 3955/7394 cut-off events. [2022-12-13 10:02:23,037 INFO L131 PetriNetUnfolder]: For 403235/403235 co-relation queries the response was YES. [2022-12-13 10:02:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75825 conditions, 7394 events. 3955/7394 cut-off events. For 403235/403235 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 58192 event pairs, 1301 based on Foata normal form. 28/7414 useless extension candidates. Maximal degree in co-relation 74373. Up to 6606 conditions per place. [2022-12-13 10:02:23,114 INFO L137 encePairwiseOnDemand]: 42/85 looper letters, 365 selfloop transitions, 146 changer transitions 2/513 dead transitions. [2022-12-13 10:02:23,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 513 transitions, 12152 flow [2022-12-13 10:02:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:02:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:02:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-13 10:02:23,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1607843137254902 [2022-12-13 10:02:23,115 INFO L175 Difference]: Start difference. First operand has 239 places, 434 transitions, 9764 flow. Second operand 12 states and 164 transitions. [2022-12-13 10:02:23,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 513 transitions, 12152 flow [2022-12-13 10:02:24,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 513 transitions, 12069 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-13 10:02:24,461 INFO L231 Difference]: Finished difference. Result has 250 places, 458 transitions, 10524 flow [2022-12-13 10:02:24,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=9681, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10524, PETRI_PLACES=250, PETRI_TRANSITIONS=458} [2022-12-13 10:02:24,462 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 229 predicate places. [2022-12-13 10:02:24,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:24,462 INFO L89 Accepts]: Start accepts. Operand has 250 places, 458 transitions, 10524 flow [2022-12-13 10:02:24,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:24,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:24,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 458 transitions, 10524 flow [2022-12-13 10:02:24,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 458 transitions, 10524 flow [2022-12-13 10:02:24,826 INFO L130 PetriNetUnfolder]: 789/2799 cut-off events. [2022-12-13 10:02:24,827 INFO L131 PetriNetUnfolder]: For 102215/102369 co-relation queries the response was YES. [2022-12-13 10:02:24,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22738 conditions, 2799 events. 789/2799 cut-off events. For 102215/102369 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30255 event pairs, 261 based on Foata normal form. 21/2600 useless extension candidates. Maximal degree in co-relation 22358. Up to 585 conditions per place. [2022-12-13 10:02:24,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 458 transitions, 10524 flow [2022-12-13 10:02:24,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 2066 [2022-12-13 10:02:26,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:02:26,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1634 [2022-12-13 10:02:26,096 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 457 transitions, 10518 flow [2022-12-13 10:02:26,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:26,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:26,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:26,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:26,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-13 10:02:26,296 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1324541271, now seen corresponding path program 2 times [2022-12-13 10:02:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:26,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308058616] [2022-12-13 10:02:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:26,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:26,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308058616] [2022-12-13 10:02:26,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308058616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:26,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456361933] [2022-12-13 10:02:26,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:02:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:26,492 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 10:02:26,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:02:26,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:02:26,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:02:26,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:26,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:28,861 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:28,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:02:28,891 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:02:28,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:02:28,904 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:28,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:02:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:28,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456361933] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:28,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:28,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:02:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395298446] [2022-12-13 10:02:28,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:28,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:02:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:02:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:02:28,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-13 10:02:28,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 457 transitions, 10518 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:28,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:28,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-13 10:02:28,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:31,281 INFO L130 PetriNetUnfolder]: 4029/7523 cut-off events. [2022-12-13 10:02:31,281 INFO L131 PetriNetUnfolder]: For 445639/445639 co-relation queries the response was YES. [2022-12-13 10:02:31,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78926 conditions, 7523 events. 4029/7523 cut-off events. For 445639/445639 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 59128 event pairs, 1115 based on Foata normal form. 68/7583 useless extension candidates. Maximal degree in co-relation 77467. Up to 6645 conditions per place. [2022-12-13 10:02:31,376 INFO L137 encePairwiseOnDemand]: 26/85 looper letters, 363 selfloop transitions, 181 changer transitions 3/547 dead transitions. [2022-12-13 10:02:31,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 547 transitions, 12559 flow [2022-12-13 10:02:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 10:02:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 10:02:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 222 transitions. [2022-12-13 10:02:31,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15363321799307958 [2022-12-13 10:02:31,377 INFO L175 Difference]: Start difference. First operand has 249 places, 457 transitions, 10518 flow. Second operand 17 states and 222 transitions. [2022-12-13 10:02:31,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 547 transitions, 12559 flow [2022-12-13 10:02:33,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 547 transitions, 12353 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-12-13 10:02:33,084 INFO L231 Difference]: Finished difference. Result has 261 places, 469 transitions, 10937 flow [2022-12-13 10:02:33,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=10324, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10937, PETRI_PLACES=261, PETRI_TRANSITIONS=469} [2022-12-13 10:02:33,085 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2022-12-13 10:02:33,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:33,085 INFO L89 Accepts]: Start accepts. Operand has 261 places, 469 transitions, 10937 flow [2022-12-13 10:02:33,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:33,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:33,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 469 transitions, 10937 flow [2022-12-13 10:02:33,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 469 transitions, 10937 flow [2022-12-13 10:02:33,577 INFO L130 PetriNetUnfolder]: 805/2870 cut-off events. [2022-12-13 10:02:33,578 INFO L131 PetriNetUnfolder]: For 108476/108637 co-relation queries the response was YES. [2022-12-13 10:02:33,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23357 conditions, 2870 events. 805/2870 cut-off events. For 108476/108637 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 31183 event pairs, 270 based on Foata normal form. 20/2665 useless extension candidates. Maximal degree in co-relation 22968. Up to 606 conditions per place. [2022-12-13 10:02:33,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 469 transitions, 10937 flow [2022-12-13 10:02:33,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 2130 [2022-12-13 10:02:33,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:02:33,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:02:33,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:02:34,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:02:34,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:02:34,370 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:02:34,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1285 [2022-12-13 10:02:34,370 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 467 transitions, 11189 flow [2022-12-13 10:02:34,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:34,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:34,370 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:34,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-13 10:02:34,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-13 10:02:34,575 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 991346988, now seen corresponding path program 1 times [2022-12-13 10:02:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:34,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556582555] [2022-12-13 10:02:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556582555] [2022-12-13 10:02:34,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556582555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:34,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785600289] [2022-12-13 10:02:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:34,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:34,780 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:34,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 10:02:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:34,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 10:02:34,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:34,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:34,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:34,982 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:02:34,982 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 23 treesize of output 28 [2022-12-13 10:02:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:35,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:35,079 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:02:35,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 147 [2022-12-13 10:02:35,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:35,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2022-12-13 10:02:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:35,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785600289] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:35,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:35,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:02:35,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537040844] [2022-12-13 10:02:35,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:35,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:02:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:02:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:02:35,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-13 10:02:35,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 467 transitions, 11189 flow. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:35,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:35,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-13 10:02:35,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:37,049 INFO L130 PetriNetUnfolder]: 4067/7594 cut-off events. [2022-12-13 10:02:37,050 INFO L131 PetriNetUnfolder]: For 472968/472968 co-relation queries the response was YES. [2022-12-13 10:02:37,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82029 conditions, 7594 events. 4067/7594 cut-off events. For 472968/472968 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 60224 event pairs, 1725 based on Foata normal form. 4/7588 useless extension candidates. Maximal degree in co-relation 80531. Up to 7455 conditions per place. [2022-12-13 10:02:37,142 INFO L137 encePairwiseOnDemand]: 62/99 looper letters, 431 selfloop transitions, 63 changer transitions 12/506 dead transitions. [2022-12-13 10:02:37,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 506 transitions, 12703 flow [2022-12-13 10:02:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:02:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:02:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-12-13 10:02:37,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21212121212121213 [2022-12-13 10:02:37,143 INFO L175 Difference]: Start difference. First operand has 259 places, 467 transitions, 11189 flow. Second operand 7 states and 147 transitions. [2022-12-13 10:02:37,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 506 transitions, 12703 flow [2022-12-13 10:02:39,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 506 transitions, 12181 flow, removed 111 selfloop flow, removed 11 redundant places. [2022-12-13 10:02:39,314 INFO L231 Difference]: Finished difference. Result has 257 places, 475 transitions, 11020 flow [2022-12-13 10:02:39,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=10714, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11020, PETRI_PLACES=257, PETRI_TRANSITIONS=475} [2022-12-13 10:02:39,315 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 236 predicate places. [2022-12-13 10:02:39,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:39,315 INFO L89 Accepts]: Start accepts. Operand has 257 places, 475 transitions, 11020 flow [2022-12-13 10:02:39,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:39,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:39,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 475 transitions, 11020 flow [2022-12-13 10:02:39,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 475 transitions, 11020 flow [2022-12-13 10:02:39,721 INFO L130 PetriNetUnfolder]: 819/2900 cut-off events. [2022-12-13 10:02:39,721 INFO L131 PetriNetUnfolder]: For 108791/108978 co-relation queries the response was YES. [2022-12-13 10:02:39,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23514 conditions, 2900 events. 819/2900 cut-off events. For 108791/108978 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 31570 event pairs, 274 based on Foata normal form. 23/2686 useless extension candidates. Maximal degree in co-relation 23178. Up to 617 conditions per place. [2022-12-13 10:02:39,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 475 transitions, 11020 flow [2022-12-13 10:02:39,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 2142 [2022-12-13 10:02:39,769 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:02:39,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 454 [2022-12-13 10:02:39,769 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 475 transitions, 11020 flow [2022-12-13 10:02:39,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:39,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:39,769 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:39,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-13 10:02:39,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 10:02:39,970 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash -300278250, now seen corresponding path program 1 times [2022-12-13 10:02:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:39,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965568952] [2022-12-13 10:02:39,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:40,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965568952] [2022-12-13 10:02:40,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965568952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:40,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751010100] [2022-12-13 10:02:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:40,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:40,206 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:40,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 10:02:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:40,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:02:40,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:40,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:40,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:40,432 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:02:40,433 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 23 treesize of output 28 [2022-12-13 10:02:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:40,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:40,534 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:02:40,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 147 [2022-12-13 10:02:40,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:40,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2022-12-13 10:02:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:40,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751010100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:40,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:40,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:02:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306087016] [2022-12-13 10:02:40,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:40,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:02:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:40,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:02:40,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:02:40,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 10:02:40,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 475 transitions, 11020 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:40,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:40,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 10:02:40,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:42,788 INFO L130 PetriNetUnfolder]: 4103/7657 cut-off events. [2022-12-13 10:02:42,788 INFO L131 PetriNetUnfolder]: For 472888/472888 co-relation queries the response was YES. [2022-12-13 10:02:42,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81811 conditions, 7657 events. 4103/7657 cut-off events. For 472888/472888 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 60596 event pairs, 1575 based on Foata normal form. 4/7650 useless extension candidates. Maximal degree in co-relation 80782. Up to 7450 conditions per place. [2022-12-13 10:02:42,868 INFO L137 encePairwiseOnDemand]: 51/98 looper letters, 396 selfloop transitions, 100 changer transitions 12/508 dead transitions. [2022-12-13 10:02:42,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 508 transitions, 12441 flow [2022-12-13 10:02:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:02:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:02:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-12-13 10:02:42,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22959183673469388 [2022-12-13 10:02:42,869 INFO L175 Difference]: Start difference. First operand has 255 places, 475 transitions, 11020 flow. Second operand 6 states and 135 transitions. [2022-12-13 10:02:42,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 508 transitions, 12441 flow [2022-12-13 10:02:44,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 508 transitions, 12335 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 10:02:44,607 INFO L231 Difference]: Finished difference. Result has 258 places, 482 transitions, 11291 flow [2022-12-13 10:02:44,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=10914, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11291, PETRI_PLACES=258, PETRI_TRANSITIONS=482} [2022-12-13 10:02:44,608 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 237 predicate places. [2022-12-13 10:02:44,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:44,608 INFO L89 Accepts]: Start accepts. Operand has 258 places, 482 transitions, 11291 flow [2022-12-13 10:02:44,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:44,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:44,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 482 transitions, 11291 flow [2022-12-13 10:02:44,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 482 transitions, 11291 flow [2022-12-13 10:02:45,039 INFO L130 PetriNetUnfolder]: 825/2918 cut-off events. [2022-12-13 10:02:45,039 INFO L131 PetriNetUnfolder]: For 110477/110671 co-relation queries the response was YES. [2022-12-13 10:02:45,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23734 conditions, 2918 events. 825/2918 cut-off events. For 110477/110671 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 31555 event pairs, 278 based on Foata normal form. 25/2705 useless extension candidates. Maximal degree in co-relation 23512. Up to 618 conditions per place. [2022-12-13 10:02:45,087 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 482 transitions, 11291 flow [2022-12-13 10:02:45,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 2164 [2022-12-13 10:02:45,088 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:02:45,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 481 [2022-12-13 10:02:45,089 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 482 transitions, 11291 flow [2022-12-13 10:02:45,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:45,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:45,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:45,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-13 10:02:45,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:45,289 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1283440838, now seen corresponding path program 1 times [2022-12-13 10:02:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:45,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776661957] [2022-12-13 10:02:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:45,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776661957] [2022-12-13 10:02:45,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776661957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:45,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657171256] [2022-12-13 10:02:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:45,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:45,666 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:45,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 10:02:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:45,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:02:45,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:45,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:45,925 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:02:45,925 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 22 treesize of output 27 [2022-12-13 10:02:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:45,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:46,093 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:02:46,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 159 [2022-12-13 10:02:46,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:46,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 62 [2022-12-13 10:02:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:46,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657171256] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:46,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:46,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 10:02:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972172623] [2022-12-13 10:02:46,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:46,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:02:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:02:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=164, Unknown=4, NotChecked=0, Total=210 [2022-12-13 10:02:46,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 97 [2022-12-13 10:02:46,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 482 transitions, 11291 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:46,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:46,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 97 [2022-12-13 10:02:46,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:46,421 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~i_BA~0 4))) (let ((.cse0 (+ c_~i_BA~0 1)) (.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse3 (select |c_#memory_int| c_~B~0.base)) (.cse4 (+ c_~A~0.offset .cse2 4)) (.cse5 (+ .cse2 4 c_~B~0.offset))) (and (< .cse0 c_~An~0) (< c_~i_BA~0 c_~An~0) (< c_~i_BA~0 c_~Bn~0) (= (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse3 (+ .cse2 c_~B~0.offset))) (< .cse0 c_~Bn~0) (= (select .cse1 .cse4) (select .cse3 .cse5)) (forall ((v_ArrVal_3299 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3299))) (= (select (select .cse6 c_~A~0.base) .cse4) (select (select .cse6 c_~B~0.base) .cse5))))))) is different from false [2022-12-13 10:02:49,078 INFO L130 PetriNetUnfolder]: 4295/7999 cut-off events. [2022-12-13 10:02:49,078 INFO L131 PetriNetUnfolder]: For 492957/492957 co-relation queries the response was YES. [2022-12-13 10:02:49,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84543 conditions, 7999 events. 4295/7999 cut-off events. For 492957/492957 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 63244 event pairs, 1257 based on Foata normal form. 43/8032 useless extension candidates. Maximal degree in co-relation 84339. Up to 7427 conditions per place. [2022-12-13 10:02:49,162 INFO L137 encePairwiseOnDemand]: 48/97 looper letters, 474 selfloop transitions, 107 changer transitions 0/581 dead transitions. [2022-12-13 10:02:49,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 581 transitions, 13488 flow [2022-12-13 10:02:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:02:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:02:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 212 transitions. [2022-12-13 10:02:49,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13659793814432988 [2022-12-13 10:02:49,163 INFO L175 Difference]: Start difference. First operand has 256 places, 482 transitions, 11291 flow. Second operand 16 states and 212 transitions. [2022-12-13 10:02:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 581 transitions, 13488 flow [2022-12-13 10:02:51,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 581 transitions, 13321 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 10:02:51,132 INFO L231 Difference]: Finished difference. Result has 275 places, 516 transitions, 12007 flow [2022-12-13 10:02:51,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=11101, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12007, PETRI_PLACES=275, PETRI_TRANSITIONS=516} [2022-12-13 10:02:51,132 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 254 predicate places. [2022-12-13 10:02:51,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:51,132 INFO L89 Accepts]: Start accepts. Operand has 275 places, 516 transitions, 12007 flow [2022-12-13 10:02:51,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:51,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:51,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 516 transitions, 12007 flow [2022-12-13 10:02:51,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 516 transitions, 12007 flow [2022-12-13 10:02:51,629 INFO L130 PetriNetUnfolder]: 872/3092 cut-off events. [2022-12-13 10:02:51,630 INFO L131 PetriNetUnfolder]: For 128651/129205 co-relation queries the response was YES. [2022-12-13 10:02:51,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26739 conditions, 3092 events. 872/3092 cut-off events. For 128651/129205 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 34026 event pairs, 289 based on Foata normal form. 13/2857 useless extension candidates. Maximal degree in co-relation 26199. Up to 667 conditions per place. [2022-12-13 10:02:51,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 516 transitions, 12007 flow [2022-12-13 10:02:51,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 2344 [2022-12-13 10:02:51,748 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [572] L47-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_Out_2| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_Out_2| 0) (or (not (< v_~i_AB~0_In_1 v_~Bn~0_In_5)) (not (< v_~i_AB~0_In_1 v_~An~0_In_3)))) InVars {~i_AB~0=v_~i_AB~0_In_1, ~Bn~0=v_~Bn~0_In_5, ~An~0=v_~An~0_In_3} OutVars{~i_AB~0=v_~i_AB~0_In_1, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_2|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_2|, ~Bn~0=v_~Bn~0_In_5, ~An~0=v_~An~0_In_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] [2022-12-13 10:02:51,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:02:51,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 672 [2022-12-13 10:02:51,804 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 516 transitions, 12016 flow [2022-12-13 10:02:51,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:51,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:51,804 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:51,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-13 10:02:52,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:52,005 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1420197027, now seen corresponding path program 1 times [2022-12-13 10:02:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:52,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192496076] [2022-12-13 10:02:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:52,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192496076] [2022-12-13 10:02:52,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192496076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778608649] [2022-12-13 10:02:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:52,286 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:52,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 10:02:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:52,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:02:52,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:52,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:52,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:02:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:52,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:52,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-13 10:02:52,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:52,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-13 10:02:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:53,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778608649] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:53,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:53,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:02:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379164901] [2022-12-13 10:02:53,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:02:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:02:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:02:53,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 10:02:53,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 516 transitions, 12016 flow. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:53,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:53,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 10:02:53,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:02:55,588 INFO L130 PetriNetUnfolder]: 4299/8021 cut-off events. [2022-12-13 10:02:55,589 INFO L131 PetriNetUnfolder]: For 553606/553606 co-relation queries the response was YES. [2022-12-13 10:02:55,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90691 conditions, 8021 events. 4299/8021 cut-off events. For 553606/553606 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 63649 event pairs, 1672 based on Foata normal form. 8/8019 useless extension candidates. Maximal degree in co-relation 88943. Up to 7775 conditions per place. [2022-12-13 10:02:55,685 INFO L137 encePairwiseOnDemand]: 49/98 looper letters, 432 selfloop transitions, 109 changer transitions 23/564 dead transitions. [2022-12-13 10:02:55,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 564 transitions, 13714 flow [2022-12-13 10:02:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:02:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:02:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2022-12-13 10:02:55,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15120593692022263 [2022-12-13 10:02:55,686 INFO L175 Difference]: Start difference. First operand has 275 places, 516 transitions, 12016 flow. Second operand 11 states and 163 transitions. [2022-12-13 10:02:55,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 564 transitions, 13714 flow [2022-12-13 10:02:57,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 564 transitions, 13518 flow, removed 51 selfloop flow, removed 6 redundant places. [2022-12-13 10:02:57,471 INFO L231 Difference]: Finished difference. Result has 285 places, 518 transitions, 12115 flow [2022-12-13 10:02:57,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=11820, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12115, PETRI_PLACES=285, PETRI_TRANSITIONS=518} [2022-12-13 10:02:57,471 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 264 predicate places. [2022-12-13 10:02:57,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:02:57,472 INFO L89 Accepts]: Start accepts. Operand has 285 places, 518 transitions, 12115 flow [2022-12-13 10:02:57,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:02:57,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:02:57,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 518 transitions, 12115 flow [2022-12-13 10:02:57,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 518 transitions, 12115 flow [2022-12-13 10:02:57,986 INFO L130 PetriNetUnfolder]: 867/3081 cut-off events. [2022-12-13 10:02:57,986 INFO L131 PetriNetUnfolder]: For 134018/134554 co-relation queries the response was YES. [2022-12-13 10:02:58,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26940 conditions, 3081 events. 867/3081 cut-off events. For 134018/134554 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 34005 event pairs, 289 based on Foata normal form. 17/2855 useless extension candidates. Maximal degree in co-relation 26807. Up to 669 conditions per place. [2022-12-13 10:02:58,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 518 transitions, 12115 flow [2022-12-13 10:02:58,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 2336 [2022-12-13 10:02:58,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:02:58,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 566 [2022-12-13 10:02:58,037 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 518 transitions, 12115 flow [2022-12-13 10:02:58,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:58,037 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:02:58,037 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:02:58,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-13 10:02:58,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:58,238 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:02:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:02:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash 692375978, now seen corresponding path program 1 times [2022-12-13 10:02:58,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:02:58,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995210545] [2022-12-13 10:02:58,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:02:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:02:58,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995210545] [2022-12-13 10:02:58,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995210545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:02:58,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749093196] [2022-12-13 10:02:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:02:58,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:02:58,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:02:58,496 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:02:58,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 10:02:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:02:58,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:02:58,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:02:58,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:02:58,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:02:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:58,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:02:58,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:58,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 37 [2022-12-13 10:02:58,933 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 25 treesize of output 18 [2022-12-13 10:02:58,989 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:02:58,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 164 [2022-12-13 10:02:59,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:02:59,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2022-12-13 10:02:59,255 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:02:59,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:02:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:02:59,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749093196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:02:59,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:02:59,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:02:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555589119] [2022-12-13 10:02:59,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:02:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:02:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:02:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:02:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:02:59,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 10:02:59,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 518 transitions, 12115 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:02:59,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:02:59,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 10:02:59,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:02,169 INFO L130 PetriNetUnfolder]: 4558/8464 cut-off events. [2022-12-13 10:03:02,169 INFO L131 PetriNetUnfolder]: For 625057/625057 co-relation queries the response was YES. [2022-12-13 10:03:02,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95334 conditions, 8464 events. 4558/8464 cut-off events. For 625057/625057 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 67551 event pairs, 1628 based on Foata normal form. 108/8564 useless extension candidates. Maximal degree in co-relation 95184. Up to 7389 conditions per place. [2022-12-13 10:03:02,274 INFO L137 encePairwiseOnDemand]: 44/98 looper letters, 498 selfloop transitions, 152 changer transitions 1/651 dead transitions. [2022-12-13 10:03:02,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 651 transitions, 15088 flow [2022-12-13 10:03:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:03:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:03:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 240 transitions. [2022-12-13 10:03:02,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1360544217687075 [2022-12-13 10:03:02,275 INFO L175 Difference]: Start difference. First operand has 281 places, 518 transitions, 12115 flow. Second operand 18 states and 240 transitions. [2022-12-13 10:03:02,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 651 transitions, 15088 flow [2022-12-13 10:03:04,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 651 transitions, 14854 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-13 10:03:04,354 INFO L231 Difference]: Finished difference. Result has 293 places, 535 transitions, 12670 flow [2022-12-13 10:03:04,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=11895, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=12670, PETRI_PLACES=293, PETRI_TRANSITIONS=535} [2022-12-13 10:03:04,355 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 272 predicate places. [2022-12-13 10:03:04,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:04,355 INFO L89 Accepts]: Start accepts. Operand has 293 places, 535 transitions, 12670 flow [2022-12-13 10:03:04,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:04,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:04,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 535 transitions, 12670 flow [2022-12-13 10:03:04,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 535 transitions, 12670 flow [2022-12-13 10:03:04,840 INFO L130 PetriNetUnfolder]: 920/3228 cut-off events. [2022-12-13 10:03:04,840 INFO L131 PetriNetUnfolder]: For 150766/151373 co-relation queries the response was YES. [2022-12-13 10:03:04,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28557 conditions, 3228 events. 920/3228 cut-off events. For 150766/151373 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 35839 event pairs, 309 based on Foata normal form. 13/2990 useless extension candidates. Maximal degree in co-relation 27972. Up to 701 conditions per place. [2022-12-13 10:03:04,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 535 transitions, 12670 flow [2022-12-13 10:03:04,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 2502 [2022-12-13 10:03:04,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-5-->L80-3: Formula: (let ((.cse0 (select |v_#memory_int_612| v_~A~0.base_331))) (and (= (store |v_#memory_int_612| |v_ULTIMATE.start_main_~#t2~0#1.base_132| (store (select |v_#memory_int_612| |v_ULTIMATE.start_main_~#t2~0#1.base_132|) |v_ULTIMATE.start_main_~#t2~0#1.offset_132| |v_ULTIMATE.start_main_#t~pre13#1_206|)) |v_#memory_int_611|) (= (+ v_~i_AB~0_558 1) v_~i_AB~0_557) (= |v_#pthreadsForks_270| (+ |v_#pthreadsForks_271| 1)) (= (select .cse0 (+ v_~A~0.offset_331 (* v_~i_AB~0_557 4))) |v_thread1Thread1of1ForFork1_#t~mem1_493|) (< v_~i_AB~0_557 v_~Bn~0_326) (< v_~i_AB~0_557 v_~An~0_300) (= |v_ULTIMATE.start_main_#t~pre13#1_206| |v_#pthreadsForks_271|) (let ((.cse1 (* v_~i_AB~0_558 4))) (= (select (select |v_#memory_int_612| v_~B~0.base_324) (+ v_~B~0.offset_324 .cse1)) (select .cse0 (+ v_~A~0.offset_331 .cse1)))))) InVars {~A~0.base=v_~A~0.base_331, ~A~0.offset=v_~A~0.offset_331, ~B~0.base=v_~B~0.base_324, #pthreadsForks=|v_#pthreadsForks_271|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_132|, ~i_AB~0=v_~i_AB~0_558, #memory_int=|v_#memory_int_612|, ~Bn~0=v_~Bn~0_326, ~B~0.offset=v_~B~0.offset_324, ~An~0=v_~An~0_300, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_132|} OutVars{~A~0.base=v_~A~0.base_331, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_206|, ~B~0.base=v_~B~0.base_324, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_203|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_132|, ~i_AB~0=v_~i_AB~0_557, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_267|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_158|, ~An~0=v_~An~0_300, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_493|, ~A~0.offset=v_~A~0.offset_331, #pthreadsForks=|v_#pthreadsForks_270|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_317|, #memory_int=|v_#memory_int_611|, ~Bn~0=v_~Bn~0_326, ~B~0.offset=v_~B~0.offset_324, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_132|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:04,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [701] L47-5-->L80-3: Formula: (let ((.cse0 (select |v_#memory_int_630| v_~A~0.base_343))) (and (= (store |v_#memory_int_630| |v_ULTIMATE.start_main_~#t2~0#1.base_138| (store (select |v_#memory_int_630| |v_ULTIMATE.start_main_~#t2~0#1.base_138|) |v_ULTIMATE.start_main_~#t2~0#1.offset_138| |v_ULTIMATE.start_main_#t~pre13#1_212|)) |v_#memory_int_629|) (= (+ |v_#pthreadsForks_283| 1) |v_#pthreadsForks_282|) (= (+ v_~i_AB~0_584 1) v_~i_AB~0_583) (< v_~i_AB~0_583 v_~An~0_312) (let ((.cse1 (* v_~i_AB~0_584 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_343)) (select (select |v_#memory_int_630| v_~B~0.base_336) (+ v_~B~0.offset_336 .cse1)))) (< v_~i_AB~0_583 v_~Bn~0_338) (= |v_ULTIMATE.start_main_#t~pre13#1_212| |v_#pthreadsForks_283|) (= |v_thread1Thread1of1ForFork1_#t~mem1_513| (select .cse0 (+ v_~A~0.offset_343 (* v_~i_AB~0_583 4)))))) InVars {~A~0.base=v_~A~0.base_343, ~A~0.offset=v_~A~0.offset_343, ~B~0.base=v_~B~0.base_336, #pthreadsForks=|v_#pthreadsForks_283|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_138|, ~i_AB~0=v_~i_AB~0_584, #memory_int=|v_#memory_int_630|, ~Bn~0=v_~Bn~0_338, ~B~0.offset=v_~B~0.offset_336, ~An~0=v_~An~0_312, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_138|} OutVars{~A~0.base=v_~A~0.base_343, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_212|, ~B~0.base=v_~B~0.base_336, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_209|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_138|, ~i_AB~0=v_~i_AB~0_583, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_281|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_164|, ~An~0=v_~An~0_312, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_513|, ~A~0.offset=v_~A~0.offset_343, #pthreadsForks=|v_#pthreadsForks_282|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_333|, #memory_int=|v_#memory_int_629|, ~Bn~0=v_~Bn~0_338, ~B~0.offset=v_~B~0.offset_336, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_138|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:05,002 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:03:05,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 648 [2022-12-13 10:03:05,003 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 535 transitions, 12723 flow [2022-12-13 10:03:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:05,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:05,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:05,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-13 10:03:05,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-13 10:03:05,204 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash -119036054, now seen corresponding path program 2 times [2022-12-13 10:03:05,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:05,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710560149] [2022-12-13 10:03:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:05,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:05,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710560149] [2022-12-13 10:03:05,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710560149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:03:05,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851913475] [2022-12-13 10:03:05,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:03:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:03:05,480 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:03:05,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 10:03:05,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:03:05,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:03:05,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:03:05,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:03:05,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:03:05,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:03:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:05,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:03:05,999 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:03:05,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 164 [2022-12-13 10:03:06,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:03:06,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2022-12-13 10:03:06,229 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:03:06,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:03:06,238 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:03:06,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:03:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:06,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851913475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:03:06,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:03:06,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:03:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144326463] [2022-12-13 10:03:06,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:03:06,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:03:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:03:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:03:06,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 100 [2022-12-13 10:03:06,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 535 transitions, 12723 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:06,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:06,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 100 [2022-12-13 10:03:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:09,341 INFO L130 PetriNetUnfolder]: 4574/8492 cut-off events. [2022-12-13 10:03:09,341 INFO L131 PetriNetUnfolder]: For 664244/664244 co-relation queries the response was YES. [2022-12-13 10:03:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99242 conditions, 8492 events. 4574/8492 cut-off events. For 664244/664244 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 67873 event pairs, 2132 based on Foata normal form. 6/8495 useless extension candidates. Maximal degree in co-relation 97384. Up to 8388 conditions per place. [2022-12-13 10:03:09,447 INFO L137 encePairwiseOnDemand]: 48/100 looper letters, 466 selfloop transitions, 109 changer transitions 8/583 dead transitions. [2022-12-13 10:03:09,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 583 transitions, 14589 flow [2022-12-13 10:03:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 10:03:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 10:03:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 178 transitions. [2022-12-13 10:03:09,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10470588235294118 [2022-12-13 10:03:09,448 INFO L175 Difference]: Start difference. First operand has 293 places, 535 transitions, 12723 flow. Second operand 17 states and 178 transitions. [2022-12-13 10:03:09,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 583 transitions, 14589 flow [2022-12-13 10:03:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 583 transitions, 14351 flow, removed 74 selfloop flow, removed 7 redundant places. [2022-12-13 10:03:11,930 INFO L231 Difference]: Finished difference. Result has 308 places, 547 transitions, 13017 flow [2022-12-13 10:03:11,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=12485, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=13017, PETRI_PLACES=308, PETRI_TRANSITIONS=547} [2022-12-13 10:03:11,931 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 287 predicate places. [2022-12-13 10:03:11,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:11,931 INFO L89 Accepts]: Start accepts. Operand has 308 places, 547 transitions, 13017 flow [2022-12-13 10:03:11,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:11,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:11,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 547 transitions, 13017 flow [2022-12-13 10:03:11,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 547 transitions, 13017 flow [2022-12-13 10:03:12,477 INFO L130 PetriNetUnfolder]: 919/3232 cut-off events. [2022-12-13 10:03:12,477 INFO L131 PetriNetUnfolder]: For 177663/178267 co-relation queries the response was YES. [2022-12-13 10:03:12,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29767 conditions, 3232 events. 919/3232 cut-off events. For 177663/178267 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 35677 event pairs, 302 based on Foata normal form. 21/3015 useless extension candidates. Maximal degree in co-relation 29616. Up to 699 conditions per place. [2022-12-13 10:03:12,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 547 transitions, 13017 flow [2022-12-13 10:03:12,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 2508 [2022-12-13 10:03:12,544 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:03:12,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 613 [2022-12-13 10:03:12,544 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 547 transitions, 13017 flow [2022-12-13 10:03:12,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:12,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:12,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:12,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-13 10:03:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-13 10:03:12,750 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1315176046, now seen corresponding path program 3 times [2022-12-13 10:03:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484479344] [2022-12-13 10:03:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:13,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484479344] [2022-12-13 10:03:13,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484479344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:03:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125857739] [2022-12-13 10:03:13,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 10:03:13,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:03:13,043 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:03:13,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 10:03:13,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 10:03:13,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:03:13,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:03:13,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:03:13,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:03:13,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:03:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:13,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:03:13,548 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 10:03:13,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 164 [2022-12-13 10:03:13,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:03:13,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 96 [2022-12-13 10:03:13,819 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:03:13,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:03:13,825 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:03:13,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 25 [2022-12-13 10:03:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:13,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125857739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:03:13,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:03:13,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:03:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827279369] [2022-12-13 10:03:13,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:03:13,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:03:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:03:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:03:13,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 100 [2022-12-13 10:03:13,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 547 transitions, 13017 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:13,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:13,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 100 [2022-12-13 10:03:13,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:17,166 INFO L130 PetriNetUnfolder]: 4774/8856 cut-off events. [2022-12-13 10:03:17,166 INFO L131 PetriNetUnfolder]: For 818145/818145 co-relation queries the response was YES. [2022-12-13 10:03:17,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104725 conditions, 8856 events. 4774/8856 cut-off events. For 818145/818145 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 71074 event pairs, 1767 based on Foata normal form. 102/8955 useless extension candidates. Maximal degree in co-relation 104543. Up to 7712 conditions per place. [2022-12-13 10:03:17,273 INFO L137 encePairwiseOnDemand]: 38/100 looper letters, 437 selfloop transitions, 200 changer transitions 3/640 dead transitions. [2022-12-13 10:03:17,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 640 transitions, 15443 flow [2022-12-13 10:03:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 10:03:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 10:03:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 216 transitions. [2022-12-13 10:03:17,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12705882352941175 [2022-12-13 10:03:17,274 INFO L175 Difference]: Start difference. First operand has 305 places, 547 transitions, 13017 flow. Second operand 17 states and 216 transitions. [2022-12-13 10:03:17,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 640 transitions, 15443 flow [2022-12-13 10:03:19,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 640 transitions, 15261 flow, removed 43 selfloop flow, removed 11 redundant places. [2022-12-13 10:03:19,772 INFO L231 Difference]: Finished difference. Result has 313 places, 565 transitions, 13738 flow [2022-12-13 10:03:19,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=12835, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=13738, PETRI_PLACES=313, PETRI_TRANSITIONS=565} [2022-12-13 10:03:19,773 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 292 predicate places. [2022-12-13 10:03:19,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:19,773 INFO L89 Accepts]: Start accepts. Operand has 313 places, 565 transitions, 13738 flow [2022-12-13 10:03:19,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:19,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:19,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 565 transitions, 13738 flow [2022-12-13 10:03:19,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 565 transitions, 13738 flow [2022-12-13 10:03:20,478 INFO L130 PetriNetUnfolder]: 959/3411 cut-off events. [2022-12-13 10:03:20,479 INFO L131 PetriNetUnfolder]: For 192434/193057 co-relation queries the response was YES. [2022-12-13 10:03:20,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31428 conditions, 3411 events. 959/3411 cut-off events. For 192434/193057 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 38385 event pairs, 321 based on Foata normal form. 16/3174 useless extension candidates. Maximal degree in co-relation 30809. Up to 747 conditions per place. [2022-12-13 10:03:20,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 565 transitions, 13738 flow [2022-12-13 10:03:20,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 2648 [2022-12-13 10:03:20,551 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:03:20,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 779 [2022-12-13 10:03:20,552 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 565 transitions, 13738 flow [2022-12-13 10:03:20,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:20,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:20,552 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:20,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-13 10:03:20,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:20,758 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2099767893, now seen corresponding path program 2 times [2022-12-13 10:03:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:20,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2440337] [2022-12-13 10:03:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:20,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2440337] [2022-12-13 10:03:20,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2440337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:03:20,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980407007] [2022-12-13 10:03:20,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:03:20,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:03:20,981 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:03:20,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-13 10:03:21,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:03:21,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:03:21,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:03:21,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:03:21,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:03:21,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:03:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:21,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:03:21,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:03:21,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-13 10:03:21,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:03:21,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-13 10:03:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:21,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980407007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:03:21,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:03:21,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:03:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135503777] [2022-12-13 10:03:21,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:03:21,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:03:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:03:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:03:21,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 100 [2022-12-13 10:03:21,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 565 transitions, 13738 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:21,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:21,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 100 [2022-12-13 10:03:21,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:24,787 INFO L130 PetriNetUnfolder]: 4872/9016 cut-off events. [2022-12-13 10:03:24,787 INFO L131 PetriNetUnfolder]: For 858761/858761 co-relation queries the response was YES. [2022-12-13 10:03:24,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110814 conditions, 9016 events. 4872/9016 cut-off events. For 858761/858761 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 72632 event pairs, 1904 based on Foata normal form. 20/9033 useless extension candidates. Maximal degree in co-relation 109088. Up to 8496 conditions per place. [2022-12-13 10:03:24,899 INFO L137 encePairwiseOnDemand]: 46/100 looper letters, 459 selfloop transitions, 169 changer transitions 1/629 dead transitions. [2022-12-13 10:03:24,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 629 transitions, 16063 flow [2022-12-13 10:03:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 10:03:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 10:03:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 185 transitions. [2022-12-13 10:03:24,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12333333333333334 [2022-12-13 10:03:24,900 INFO L175 Difference]: Start difference. First operand has 313 places, 565 transitions, 13738 flow. Second operand 15 states and 185 transitions. [2022-12-13 10:03:24,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 629 transitions, 16063 flow [2022-12-13 10:03:27,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 629 transitions, 15838 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-12-13 10:03:27,714 INFO L231 Difference]: Finished difference. Result has 318 places, 586 transitions, 14405 flow [2022-12-13 10:03:27,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=13523, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14405, PETRI_PLACES=318, PETRI_TRANSITIONS=586} [2022-12-13 10:03:27,715 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 297 predicate places. [2022-12-13 10:03:27,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:27,715 INFO L89 Accepts]: Start accepts. Operand has 318 places, 586 transitions, 14405 flow [2022-12-13 10:03:27,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:27,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:27,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 318 places, 586 transitions, 14405 flow [2022-12-13 10:03:27,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 586 transitions, 14405 flow [2022-12-13 10:03:28,278 INFO L130 PetriNetUnfolder]: 978/3455 cut-off events. [2022-12-13 10:03:28,278 INFO L131 PetriNetUnfolder]: For 202750/203402 co-relation queries the response was YES. [2022-12-13 10:03:28,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32796 conditions, 3455 events. 978/3455 cut-off events. For 202750/203402 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 38833 event pairs, 318 based on Foata normal form. 23/3223 useless extension candidates. Maximal degree in co-relation 32176. Up to 747 conditions per place. [2022-12-13 10:03:28,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 586 transitions, 14405 flow [2022-12-13 10:03:28,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 2722 [2022-12-13 10:03:28,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [566] L47-1-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_17| 0) (not (= (select (select |v_#memory_int_117| v_~B~0.base_51) (+ (* v_~i_AB~0_57 4) v_~B~0.offset_51)) |v_thread1Thread1of1ForFork1_#t~mem1_32|)) (= |v_thread1Thread1of1ForFork1_#res.base_17| 0)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_32|, ~B~0.base=v_~B~0.base_51, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, ~B~0.offset=v_~B~0.offset_51} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_17|, ~B~0.base=v_~B~0.base_51, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_33|, ~i_AB~0=v_~i_AB~0_57, #memory_int=|v_#memory_int_117|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_17|, ~B~0.offset=v_~B~0.offset_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#res.offset] [2022-12-13 10:03:28,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:28,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_637| v_~B~0.base_340)) (.cse0 (select |v_#memory_int_637| v_~A~0.base_347))) (and (< v_~i_AB~0_591 v_~An~0_316) (< v_~i_BA~0_469 v_~Bn~0_342) (let ((.cse1 (* 4 v_~i_BA~0_469))) (= (select .cse0 (+ .cse1 v_~A~0.offset_347)) (select .cse2 (+ .cse1 v_~B~0.offset_340)))) (< v_~i_AB~0_591 v_~Bn~0_342) (= (+ v_~i_BA~0_469 1) v_~i_BA~0_468) (= v_~i_AB~0_591 (+ v_~i_AB~0_592 1)) (let ((.cse3 (* v_~i_AB~0_592 4))) (= (select .cse0 (+ v_~A~0.offset_347 .cse3)) (select .cse2 (+ v_~B~0.offset_340 .cse3)))) (= (select .cse0 (+ v_~A~0.offset_347 (* v_~i_AB~0_591 4))) |v_thread1Thread1of1ForFork1_#t~mem1_521|) (< v_~i_BA~0_469 v_~An~0_316))) InVars {~A~0.base=v_~A~0.base_347, ~B~0.base=v_~B~0.base_340, ~A~0.offset=v_~A~0.offset_347, ~i_AB~0=v_~i_AB~0_592, #memory_int=|v_#memory_int_637|, ~i_BA~0=v_~i_BA~0_469, ~B~0.offset=v_~B~0.offset_340, ~Bn~0=v_~Bn~0_342, ~An~0=v_~An~0_316} OutVars{~A~0.base=v_~A~0.base_347, ~B~0.base=v_~B~0.base_340, ~i_AB~0=v_~i_AB~0_591, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_285|, ~An~0=v_~An~0_316, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_239|, ~A~0.offset=v_~A~0.offset_347, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_521|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_339|, #memory_int=|v_#memory_int_637|, ~i_BA~0=v_~i_BA~0_468, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_345|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_347|, ~B~0.offset=v_~B~0.offset_340, ~Bn~0=v_~Bn~0_342} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:28,611 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:03:28,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 896 [2022-12-13 10:03:28,612 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 585 transitions, 14483 flow [2022-12-13 10:03:28,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:28,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:28,612 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:28,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-13 10:03:28,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-13 10:03:28,817 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash -480730069, now seen corresponding path program 3 times [2022-12-13 10:03:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:28,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299840885] [2022-12-13 10:03:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:29,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:29,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299840885] [2022-12-13 10:03:29,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299840885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:03:29,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644474855] [2022-12-13 10:03:29,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 10:03:29,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:03:29,143 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:03:29,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-13 10:03:29,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 10:03:29,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:03:29,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:03:29,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:03:29,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:03:29,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 10:03:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:29,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:03:29,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:03:29,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 181 [2022-12-13 10:03:29,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:03:29,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 90 [2022-12-13 10:03:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:29,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644474855] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:03:29,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:03:29,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:03:29,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383206537] [2022-12-13 10:03:29,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:03:29,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:03:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:29,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:03:29,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:03:29,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-13 10:03:29,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 585 transitions, 14483 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:29,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:29,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-13 10:03:29,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:32,987 INFO L130 PetriNetUnfolder]: 4875/9035 cut-off events. [2022-12-13 10:03:32,988 INFO L131 PetriNetUnfolder]: For 844819/844819 co-relation queries the response was YES. [2022-12-13 10:03:33,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111522 conditions, 9035 events. 4875/9035 cut-off events. For 844819/844819 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 73028 event pairs, 1909 based on Foata normal form. 8/9040 useless extension candidates. Maximal degree in co-relation 109577. Up to 8800 conditions per place. [2022-12-13 10:03:33,110 INFO L137 encePairwiseOnDemand]: 46/105 looper letters, 487 selfloop transitions, 124 changer transitions 14/625 dead transitions. [2022-12-13 10:03:33,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 625 transitions, 16220 flow [2022-12-13 10:03:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:03:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:03:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 187 transitions. [2022-12-13 10:03:33,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1272108843537415 [2022-12-13 10:03:33,111 INFO L175 Difference]: Start difference. First operand has 317 places, 585 transitions, 14483 flow. Second operand 14 states and 187 transitions. [2022-12-13 10:03:33,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 625 transitions, 16220 flow [2022-12-13 10:03:35,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 625 transitions, 16106 flow, removed 36 selfloop flow, removed 4 redundant places. [2022-12-13 10:03:35,989 INFO L231 Difference]: Finished difference. Result has 328 places, 582 transitions, 14532 flow [2022-12-13 10:03:35,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=14369, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14532, PETRI_PLACES=328, PETRI_TRANSITIONS=582} [2022-12-13 10:03:35,990 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 307 predicate places. [2022-12-13 10:03:35,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:35,990 INFO L89 Accepts]: Start accepts. Operand has 328 places, 582 transitions, 14532 flow [2022-12-13 10:03:35,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:35,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:35,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 328 places, 582 transitions, 14532 flow [2022-12-13 10:03:35,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 582 transitions, 14532 flow [2022-12-13 10:03:36,578 INFO L130 PetriNetUnfolder]: 975/3433 cut-off events. [2022-12-13 10:03:36,578 INFO L131 PetriNetUnfolder]: For 201605/202200 co-relation queries the response was YES. [2022-12-13 10:03:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32765 conditions, 3433 events. 975/3433 cut-off events. For 201605/202200 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 38464 event pairs, 319 based on Foata normal form. 13/3190 useless extension candidates. Maximal degree in co-relation 32599. Up to 741 conditions per place. [2022-12-13 10:03:36,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 582 transitions, 14532 flow [2022-12-13 10:03:36,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 2714 [2022-12-13 10:03:36,746 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:03:36,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 756 [2022-12-13 10:03:36,746 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 582 transitions, 14532 flow [2022-12-13 10:03:36,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:36,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:36,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:36,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-13 10:03:36,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-13 10:03:36,947 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1930796396, now seen corresponding path program 1 times [2022-12-13 10:03:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:36,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800631351] [2022-12-13 10:03:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:37,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800631351] [2022-12-13 10:03:37,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800631351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:03:37,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540421585] [2022-12-13 10:03:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:37,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:03:37,360 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:03:37,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-13 10:03:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:37,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:03:37,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:03:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:37,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:03:37,867 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:03:37,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:03:37,871 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:03:37,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:03:37,901 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:03:37,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:03:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:37,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540421585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:03:37,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:03:37,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:03:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311421187] [2022-12-13 10:03:37,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:03:37,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:03:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:03:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:03:37,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 103 [2022-12-13 10:03:37,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 582 transitions, 14532 flow. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:37,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:37,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 103 [2022-12-13 10:03:37,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:40,966 INFO L130 PetriNetUnfolder]: 4974/9274 cut-off events. [2022-12-13 10:03:40,967 INFO L131 PetriNetUnfolder]: For 886523/886523 co-relation queries the response was YES. [2022-12-13 10:03:41,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113385 conditions, 9274 events. 4974/9274 cut-off events. For 886523/886523 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 75466 event pairs, 1857 based on Foata normal form. 68/9339 useless extension candidates. Maximal degree in co-relation 113150. Up to 8338 conditions per place. [2022-12-13 10:03:41,092 INFO L137 encePairwiseOnDemand]: 46/103 looper letters, 494 selfloop transitions, 160 changer transitions 1/655 dead transitions. [2022-12-13 10:03:41,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 655 transitions, 16973 flow [2022-12-13 10:03:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:03:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:03:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 206 transitions. [2022-12-13 10:03:41,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15384615384615385 [2022-12-13 10:03:41,093 INFO L175 Difference]: Start difference. First operand has 324 places, 582 transitions, 14532 flow. Second operand 13 states and 206 transitions. [2022-12-13 10:03:41,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 655 transitions, 16973 flow [2022-12-13 10:03:44,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 655 transitions, 16715 flow, removed 4 selfloop flow, removed 13 redundant places. [2022-12-13 10:03:44,015 INFO L231 Difference]: Finished difference. Result has 325 places, 591 transitions, 14846 flow [2022-12-13 10:03:44,016 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=14276, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14846, PETRI_PLACES=325, PETRI_TRANSITIONS=591} [2022-12-13 10:03:44,016 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 304 predicate places. [2022-12-13 10:03:44,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:44,016 INFO L89 Accepts]: Start accepts. Operand has 325 places, 591 transitions, 14846 flow [2022-12-13 10:03:44,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:44,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:44,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 325 places, 591 transitions, 14846 flow [2022-12-13 10:03:44,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 591 transitions, 14846 flow [2022-12-13 10:03:44,671 INFO L130 PetriNetUnfolder]: 999/3591 cut-off events. [2022-12-13 10:03:44,671 INFO L131 PetriNetUnfolder]: For 220194/220806 co-relation queries the response was YES. [2022-12-13 10:03:44,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34206 conditions, 3591 events. 999/3591 cut-off events. For 220194/220806 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 40856 event pairs, 330 based on Foata normal form. 14/3339 useless extension candidates. Maximal degree in co-relation 33572. Up to 780 conditions per place. [2022-12-13 10:03:44,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 325 places, 591 transitions, 14846 flow [2022-12-13 10:03:44,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 2778 [2022-12-13 10:03:44,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:03:44,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_639| v_~A~0.base_349)) (.cse2 (select |v_#memory_int_639| v_~B~0.base_342))) (and (let ((.cse1 (* v_~i_AB~0_596 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_349)) (select .cse2 (+ .cse1 v_~B~0.offset_342)))) (= (+ v_~i_BA~0_473 1) v_~i_BA~0_472) (< v_~i_BA~0_473 v_~An~0_318) (< v_~i_AB~0_596 v_~Bn~0_344) (< v_~i_AB~0_596 v_~An~0_318) (let ((.cse3 (* 4 v_~i_BA~0_473))) (= (select .cse0 (+ v_~A~0.offset_349 .cse3)) (select .cse2 (+ v_~B~0.offset_342 .cse3)))) (< v_~i_BA~0_473 v_~Bn~0_344) (= (+ v_~i_AB~0_596 1) v_~i_AB~0_595))) InVars {~A~0.base=v_~A~0.base_349, ~A~0.offset=v_~A~0.offset_349, ~B~0.base=v_~B~0.base_342, #memory_int=|v_#memory_int_639|, ~i_AB~0=v_~i_AB~0_596, ~i_BA~0=v_~i_BA~0_473, ~B~0.offset=v_~B~0.offset_342, ~Bn~0=v_~Bn~0_344, ~An~0=v_~An~0_318} OutVars{~A~0.base=v_~A~0.base_349, ~B~0.base=v_~B~0.base_342, ~i_AB~0=v_~i_AB~0_595, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_287|, ~An~0=v_~An~0_318, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_241|, ~A~0.offset=v_~A~0.offset_349, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_525|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_341|, #memory_int=|v_#memory_int_639|, ~i_BA~0=v_~i_BA~0_472, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_347|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_349|, ~B~0.offset=v_~B~0.offset_342, ~Bn~0=v_~Bn~0_344} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [714] L47-5-->L47-5: Formula: (and (< v_~i_AB~0_660 v_~Bn~0_364) (< v_~i_AB~0_660 v_~An~0_338) (let ((.cse0 (* v_~i_AB~0_660 4))) (= (select (select |v_#memory_int_685| v_~A~0.base_367) (+ v_~A~0.offset_367 .cse0)) (select (select |v_#memory_int_685| v_~B~0.base_361) (+ v_~B~0.offset_361 .cse0)))) (= v_~i_AB~0_659 (+ v_~i_AB~0_660 1))) InVars {~A~0.base=v_~A~0.base_367, ~B~0.base=v_~B~0.base_361, ~A~0.offset=v_~A~0.offset_367, ~i_AB~0=v_~i_AB~0_660, #memory_int=|v_#memory_int_685|, ~B~0.offset=v_~B~0.offset_361, ~Bn~0=v_~Bn~0_364, ~An~0=v_~An~0_338} OutVars{~A~0.base=v_~A~0.base_367, ~B~0.base=v_~B~0.base_361, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_581|, ~A~0.offset=v_~A~0.offset_367, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_392|, ~i_AB~0=v_~i_AB~0_659, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_333|, #memory_int=|v_#memory_int_685|, ~B~0.offset=v_~B~0.offset_361, ~Bn~0=v_~Bn~0_364, ~An~0=v_~An~0_338} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:44,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_639| v_~A~0.base_349)) (.cse2 (select |v_#memory_int_639| v_~B~0.base_342))) (and (let ((.cse1 (* v_~i_AB~0_596 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_349)) (select .cse2 (+ .cse1 v_~B~0.offset_342)))) (= (+ v_~i_BA~0_473 1) v_~i_BA~0_472) (< v_~i_BA~0_473 v_~An~0_318) (< v_~i_AB~0_596 v_~Bn~0_344) (< v_~i_AB~0_596 v_~An~0_318) (let ((.cse3 (* 4 v_~i_BA~0_473))) (= (select .cse0 (+ v_~A~0.offset_349 .cse3)) (select .cse2 (+ v_~B~0.offset_342 .cse3)))) (< v_~i_BA~0_473 v_~Bn~0_344) (= (+ v_~i_AB~0_596 1) v_~i_AB~0_595))) InVars {~A~0.base=v_~A~0.base_349, ~A~0.offset=v_~A~0.offset_349, ~B~0.base=v_~B~0.base_342, #memory_int=|v_#memory_int_639|, ~i_AB~0=v_~i_AB~0_596, ~i_BA~0=v_~i_BA~0_473, ~B~0.offset=v_~B~0.offset_342, ~Bn~0=v_~Bn~0_344, ~An~0=v_~An~0_318} OutVars{~A~0.base=v_~A~0.base_349, ~B~0.base=v_~B~0.base_342, ~i_AB~0=v_~i_AB~0_595, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_287|, ~An~0=v_~An~0_318, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_241|, ~A~0.offset=v_~A~0.offset_349, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_525|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_341|, #memory_int=|v_#memory_int_639|, ~i_BA~0=v_~i_BA~0_472, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_347|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_349|, ~B~0.offset=v_~B~0.offset_342, ~Bn~0=v_~Bn~0_344} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [715] L47-5-->L59-5: Formula: (let ((.cse1 (select |v_#memory_int_687| v_~A~0.base_369))) (and (let ((.cse0 (* 4 v_~i_BA~0_526))) (= (select (select |v_#memory_int_687| v_~B~0.base_363) (+ v_~B~0.offset_363 .cse0)) (select .cse1 (+ v_~A~0.offset_369 .cse0)))) (< v_~i_AB~0_663 v_~An~0_340) (< v_~i_BA~0_526 v_~Bn~0_366) (< v_~i_AB~0_663 v_~Bn~0_366) (< v_~i_BA~0_526 v_~An~0_340) (= (+ v_~i_BA~0_526 1) v_~i_BA~0_525) (= (select .cse1 (+ (* v_~i_AB~0_663 4) v_~A~0.offset_369)) |v_thread1Thread1of1ForFork1_#t~mem1_585|))) InVars {~A~0.base=v_~A~0.base_369, ~A~0.offset=v_~A~0.offset_369, ~B~0.base=v_~B~0.base_363, #memory_int=|v_#memory_int_687|, ~i_AB~0=v_~i_AB~0_663, ~i_BA~0=v_~i_BA~0_526, ~B~0.offset=v_~B~0.offset_363, ~Bn~0=v_~Bn~0_366, ~An~0=v_~An~0_340} OutVars{~A~0.base=v_~A~0.base_369, ~B~0.base=v_~B~0.base_363, ~i_AB~0=v_~i_AB~0_663, ~An~0=v_~An~0_340, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_282|, ~A~0.offset=v_~A~0.offset_369, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_585|, #memory_int=|v_#memory_int_687|, ~i_BA~0=v_~i_BA~0_525, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_403|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_405|, ~B~0.offset=v_~B~0.offset_363, ~Bn~0=v_~Bn~0_366} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:03:45,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_639| v_~A~0.base_349)) (.cse2 (select |v_#memory_int_639| v_~B~0.base_342))) (and (let ((.cse1 (* v_~i_AB~0_596 4))) (= (select .cse0 (+ .cse1 v_~A~0.offset_349)) (select .cse2 (+ .cse1 v_~B~0.offset_342)))) (= (+ v_~i_BA~0_473 1) v_~i_BA~0_472) (< v_~i_BA~0_473 v_~An~0_318) (< v_~i_AB~0_596 v_~Bn~0_344) (< v_~i_AB~0_596 v_~An~0_318) (let ((.cse3 (* 4 v_~i_BA~0_473))) (= (select .cse0 (+ v_~A~0.offset_349 .cse3)) (select .cse2 (+ v_~B~0.offset_342 .cse3)))) (< v_~i_BA~0_473 v_~Bn~0_344) (= (+ v_~i_AB~0_596 1) v_~i_AB~0_595))) InVars {~A~0.base=v_~A~0.base_349, ~A~0.offset=v_~A~0.offset_349, ~B~0.base=v_~B~0.base_342, #memory_int=|v_#memory_int_639|, ~i_AB~0=v_~i_AB~0_596, ~i_BA~0=v_~i_BA~0_473, ~B~0.offset=v_~B~0.offset_342, ~Bn~0=v_~Bn~0_344, ~An~0=v_~An~0_318} OutVars{~A~0.base=v_~A~0.base_349, ~B~0.base=v_~B~0.base_342, ~i_AB~0=v_~i_AB~0_595, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_287|, ~An~0=v_~An~0_318, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_241|, ~A~0.offset=v_~A~0.offset_349, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_525|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_341|, #memory_int=|v_#memory_int_639|, ~i_BA~0=v_~i_BA~0_472, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_347|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_349|, ~B~0.offset=v_~B~0.offset_342, ~Bn~0=v_~Bn~0_344} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:03:45,183 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_621| v_~B~0.base_330)) (.cse0 (select |v_#memory_int_621| v_~A~0.base_337))) (and (< v_~i_AB~0_570 v_~Bn~0_332) (< v_~i_AB~0_570 v_~An~0_306) (< v_~i_BA~0_465 v_~An~0_306) (= (+ v_~i_AB~0_570 1) v_~i_AB~0_569) (< v_~i_BA~0_465 v_~Bn~0_332) (let ((.cse1 (* 4 v_~i_BA~0_465))) (= (select .cse0 (+ .cse1 v_~A~0.offset_337)) (select .cse2 (+ .cse1 v_~B~0.offset_330)))) (= (+ v_~i_BA~0_465 1) v_~i_BA~0_464) (let ((.cse3 (* v_~i_AB~0_570 4))) (= (select .cse2 (+ v_~B~0.offset_330 .cse3)) (select .cse0 (+ v_~A~0.offset_337 .cse3)))))) InVars {~A~0.base=v_~A~0.base_337, ~A~0.offset=v_~A~0.offset_337, ~B~0.base=v_~B~0.base_330, #memory_int=|v_#memory_int_621|, ~i_AB~0=v_~i_AB~0_570, ~i_BA~0=v_~i_BA~0_465, ~B~0.offset=v_~B~0.offset_330, ~Bn~0=v_~Bn~0_332, ~An~0=v_~An~0_306} OutVars{~A~0.base=v_~A~0.base_337, ~B~0.base=v_~B~0.base_330, ~i_AB~0=v_~i_AB~0_569, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_273|, ~An~0=v_~An~0_306, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_237|, ~A~0.offset=v_~A~0.offset_337, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_505|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_325|, #memory_int=|v_#memory_int_621|, ~i_BA~0=v_~i_BA~0_464, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_343|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_345|, ~B~0.offset=v_~B~0.offset_330, ~Bn~0=v_~Bn~0_332} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:03:45,351 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:03:45,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1335 [2022-12-13 10:03:45,351 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 591 transitions, 15052 flow [2022-12-13 10:03:45,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:45,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:45,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:45,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-13 10:03:45,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:45,557 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash -822593517, now seen corresponding path program 1 times [2022-12-13 10:03:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:45,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701763225] [2022-12-13 10:03:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:45,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701763225] [2022-12-13 10:03:45,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701763225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:03:45,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061179495] [2022-12-13 10:03:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:45,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:45,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:03:45,809 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:03:45,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-13 10:03:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:46,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:03:46,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:03:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:46,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:03:46,172 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:03:46,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 88 [2022-12-13 10:03:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:46,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061179495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:03:46,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:03:46,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 10:03:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142145241] [2022-12-13 10:03:46,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:03:46,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:03:46,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:03:46,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:03:46,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 109 [2022-12-13 10:03:46,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 591 transitions, 15052 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:46,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:46,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 109 [2022-12-13 10:03:46,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:49,613 INFO L130 PetriNetUnfolder]: 4997/9291 cut-off events. [2022-12-13 10:03:49,613 INFO L131 PetriNetUnfolder]: For 931567/931567 co-relation queries the response was YES. [2022-12-13 10:03:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116940 conditions, 9291 events. 4997/9291 cut-off events. For 931567/931567 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 76026 event pairs, 1608 based on Foata normal form. 10/9298 useless extension candidates. Maximal degree in co-relation 114955. Up to 8797 conditions per place. [2022-12-13 10:03:49,821 INFO L137 encePairwiseOnDemand]: 35/109 looper letters, 463 selfloop transitions, 173 changer transitions 7/643 dead transitions. [2022-12-13 10:03:49,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 643 transitions, 17205 flow [2022-12-13 10:03:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 10:03:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 10:03:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 188 transitions. [2022-12-13 10:03:49,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11498470948012232 [2022-12-13 10:03:49,822 INFO L175 Difference]: Start difference. First operand has 325 places, 591 transitions, 15052 flow. Second operand 15 states and 188 transitions. [2022-12-13 10:03:49,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 643 transitions, 17205 flow [2022-12-13 10:03:53,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 643 transitions, 16880 flow, removed 47 selfloop flow, removed 5 redundant places. [2022-12-13 10:03:53,053 INFO L231 Difference]: Finished difference. Result has 339 places, 611 transitions, 15725 flow [2022-12-13 10:03:53,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=14727, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=15725, PETRI_PLACES=339, PETRI_TRANSITIONS=611} [2022-12-13 10:03:53,054 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 318 predicate places. [2022-12-13 10:03:53,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:03:53,054 INFO L89 Accepts]: Start accepts. Operand has 339 places, 611 transitions, 15725 flow [2022-12-13 10:03:53,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:03:53,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:03:53,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 611 transitions, 15725 flow [2022-12-13 10:03:53,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 611 transitions, 15725 flow [2022-12-13 10:03:53,646 INFO L130 PetriNetUnfolder]: 1015/3613 cut-off events. [2022-12-13 10:03:53,646 INFO L131 PetriNetUnfolder]: For 234692/235311 co-relation queries the response was YES. [2022-12-13 10:03:53,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35097 conditions, 3613 events. 1015/3613 cut-off events. For 234692/235311 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 41044 event pairs, 329 based on Foata normal form. 21/3371 useless extension candidates. Maximal degree in co-relation 34453. Up to 783 conditions per place. [2022-12-13 10:03:53,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 611 transitions, 15725 flow [2022-12-13 10:03:53,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 2808 [2022-12-13 10:03:53,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:53,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:54,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:54,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:54,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:54,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:54,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:03:54,593 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:03:54,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1540 [2022-12-13 10:03:54,594 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 608 transitions, 16064 flow [2022-12-13 10:03:54,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:54,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:03:54,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:03:54,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-13 10:03:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:03:54,794 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:03:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:03:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1407460381, now seen corresponding path program 1 times [2022-12-13 10:03:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:03:54,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135345951] [2022-12-13 10:03:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:03:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:03:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:03:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:03:55,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:03:55,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135345951] [2022-12-13 10:03:55,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135345951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:03:55,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:03:55,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:03:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831686863] [2022-12-13 10:03:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:03:55,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:03:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:03:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:03:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:03:55,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 112 [2022-12-13 10:03:55,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 608 transitions, 16064 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:03:55,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:03:55,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 112 [2022-12-13 10:03:55,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:03:57,665 INFO L130 PetriNetUnfolder]: 4966/9182 cut-off events. [2022-12-13 10:03:57,665 INFO L131 PetriNetUnfolder]: For 961234/961234 co-relation queries the response was YES. [2022-12-13 10:03:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116668 conditions, 9182 events. 4966/9182 cut-off events. For 961234/961234 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 73917 event pairs, 2332 based on Foata normal form. 2/9181 useless extension candidates. Maximal degree in co-relation 114905. Up to 9166 conditions per place. [2022-12-13 10:03:57,792 INFO L137 encePairwiseOnDemand]: 94/112 looper letters, 590 selfloop transitions, 21 changer transitions 2/613 dead transitions. [2022-12-13 10:03:57,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 613 transitions, 17289 flow [2022-12-13 10:03:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:03:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:03:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-13 10:03:57,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28794642857142855 [2022-12-13 10:03:57,793 INFO L175 Difference]: Start difference. First operand has 332 places, 608 transitions, 16064 flow. Second operand 4 states and 129 transitions. [2022-12-13 10:03:57,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 613 transitions, 17289 flow [2022-12-13 10:04:01,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 613 transitions, 16581 flow, removed 292 selfloop flow, removed 5 redundant places. [2022-12-13 10:04:02,009 INFO L231 Difference]: Finished difference. Result has 330 places, 606 transitions, 15333 flow [2022-12-13 10:04:02,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=15309, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=15333, PETRI_PLACES=330, PETRI_TRANSITIONS=606} [2022-12-13 10:04:02,009 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 309 predicate places. [2022-12-13 10:04:02,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:04:02,009 INFO L89 Accepts]: Start accepts. Operand has 330 places, 606 transitions, 15333 flow [2022-12-13 10:04:02,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:04:02,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:04:02,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 606 transitions, 15333 flow [2022-12-13 10:04:02,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 329 places, 606 transitions, 15333 flow [2022-12-13 10:04:02,622 INFO L130 PetriNetUnfolder]: 1017/3580 cut-off events. [2022-12-13 10:04:02,623 INFO L131 PetriNetUnfolder]: For 208286/208928 co-relation queries the response was YES. [2022-12-13 10:04:02,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33956 conditions, 3580 events. 1017/3580 cut-off events. For 208286/208928 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 40432 event pairs, 327 based on Foata normal form. 13/3326 useless extension candidates. Maximal degree in co-relation 33323. Up to 783 conditions per place. [2022-12-13 10:04:02,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 606 transitions, 15333 flow [2022-12-13 10:04:02,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 2798 [2022-12-13 10:04:02,710 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:04:02,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 702 [2022-12-13 10:04:02,711 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 606 transitions, 15333 flow [2022-12-13 10:04:02,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:02,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:04:02,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:04:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 10:04:02,711 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:04:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:04:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1954124549, now seen corresponding path program 1 times [2022-12-13 10:04:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:04:02,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347137379] [2022-12-13 10:04:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:04:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:04:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347137379] [2022-12-13 10:04:02,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347137379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:04:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474921163] [2022-12-13 10:04:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:02,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:02,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:04:02,962 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:04:02,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-13 10:04:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:03,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:04:03,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:04:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:03,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:04:03,338 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:04:03,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:04:03,343 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:04:03,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:04:03,375 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:04:03,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:04:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:03,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474921163] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:04:03,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:04:03,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:04:03,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782698452] [2022-12-13 10:04:03,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:04:03,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:04:03,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:04:03,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:04:03,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:04:03,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 111 [2022-12-13 10:04:03,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 606 transitions, 15333 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:03,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:04:03,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 111 [2022-12-13 10:04:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:04:06,620 INFO L130 PetriNetUnfolder]: 4947/9149 cut-off events. [2022-12-13 10:04:06,621 INFO L131 PetriNetUnfolder]: For 873983/873983 co-relation queries the response was YES. [2022-12-13 10:04:06,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113428 conditions, 9149 events. 4947/9149 cut-off events. For 873983/873983 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 73785 event pairs, 2028 based on Foata normal form. 12/9158 useless extension candidates. Maximal degree in co-relation 112109. Up to 8959 conditions per place. [2022-12-13 10:04:06,749 INFO L137 encePairwiseOnDemand]: 38/111 looper letters, 465 selfloop transitions, 162 changer transitions 0/627 dead transitions. [2022-12-13 10:04:06,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 627 transitions, 16546 flow [2022-12-13 10:04:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:04:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:04:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 187 transitions. [2022-12-13 10:04:06,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12033462033462033 [2022-12-13 10:04:06,750 INFO L175 Difference]: Start difference. First operand has 329 places, 606 transitions, 15333 flow. Second operand 14 states and 187 transitions. [2022-12-13 10:04:06,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 627 transitions, 16546 flow [2022-12-13 10:04:09,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 627 transitions, 16475 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 10:04:09,975 INFO L231 Difference]: Finished difference. Result has 336 places, 603 transitions, 15406 flow [2022-12-13 10:04:09,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=15044, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15406, PETRI_PLACES=336, PETRI_TRANSITIONS=603} [2022-12-13 10:04:09,976 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 315 predicate places. [2022-12-13 10:04:09,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:04:09,976 INFO L89 Accepts]: Start accepts. Operand has 336 places, 603 transitions, 15406 flow [2022-12-13 10:04:09,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:04:09,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:04:09,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 603 transitions, 15406 flow [2022-12-13 10:04:09,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 603 transitions, 15406 flow [2022-12-13 10:04:10,553 INFO L130 PetriNetUnfolder]: 1006/3533 cut-off events. [2022-12-13 10:04:10,554 INFO L131 PetriNetUnfolder]: For 209644/210296 co-relation queries the response was YES. [2022-12-13 10:04:10,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33893 conditions, 3533 events. 1006/3533 cut-off events. For 209644/210296 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 39645 event pairs, 328 based on Foata normal form. 14/3281 useless extension candidates. Maximal degree in co-relation 33334. Up to 768 conditions per place. [2022-12-13 10:04:10,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 603 transitions, 15406 flow [2022-12-13 10:04:10,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 2792 [2022-12-13 10:04:10,639 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:04:10,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 664 [2022-12-13 10:04:10,640 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 603 transitions, 15406 flow [2022-12-13 10:04:10,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:10,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:04:10,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:04:10,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-13 10:04:10,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:10,845 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:04:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:04:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1480274948, now seen corresponding path program 1 times [2022-12-13 10:04:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:04:10,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305930775] [2022-12-13 10:04:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:04:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:04:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305930775] [2022-12-13 10:04:11,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305930775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:04:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045443736] [2022-12-13 10:04:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:11,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:11,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:04:11,030 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:04:11,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-13 10:04:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:11,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 10:04:11,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:04:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:11,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:04:11,338 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:04:11,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 60 [2022-12-13 10:04:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:11,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045443736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:04:11,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:04:11,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:04:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599288141] [2022-12-13 10:04:11,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:04:11,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:04:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:04:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:04:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:04:11,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 105 [2022-12-13 10:04:11,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 603 transitions, 15406 flow. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:11,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:04:11,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 105 [2022-12-13 10:04:11,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:04:14,261 INFO L130 PetriNetUnfolder]: 5125/9476 cut-off events. [2022-12-13 10:04:14,261 INFO L131 PetriNetUnfolder]: For 924366/924366 co-relation queries the response was YES. [2022-12-13 10:04:14,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118790 conditions, 9476 events. 5125/9476 cut-off events. For 924366/924366 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 77042 event pairs, 1584 based on Foata normal form. 20/9492 useless extension candidates. Maximal degree in co-relation 117148. Up to 8145 conditions per place. [2022-12-13 10:04:14,392 INFO L137 encePairwiseOnDemand]: 48/105 looper letters, 470 selfloop transitions, 208 changer transitions 2/680 dead transitions. [2022-12-13 10:04:14,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 680 transitions, 18422 flow [2022-12-13 10:04:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:04:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:04:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 183 transitions. [2022-12-13 10:04:14,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13406593406593406 [2022-12-13 10:04:14,393 INFO L175 Difference]: Start difference. First operand has 336 places, 603 transitions, 15406 flow. Second operand 13 states and 183 transitions. [2022-12-13 10:04:14,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 680 transitions, 18422 flow [2022-12-13 10:04:17,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 680 transitions, 18262 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 10:04:17,471 INFO L231 Difference]: Finished difference. Result has 350 places, 628 transitions, 16370 flow [2022-12-13 10:04:17,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=15246, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=16370, PETRI_PLACES=350, PETRI_TRANSITIONS=628} [2022-12-13 10:04:17,472 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 329 predicate places. [2022-12-13 10:04:17,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:04:17,472 INFO L89 Accepts]: Start accepts. Operand has 350 places, 628 transitions, 16370 flow [2022-12-13 10:04:17,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:04:17,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:04:17,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 628 transitions, 16370 flow [2022-12-13 10:04:17,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 628 transitions, 16370 flow [2022-12-13 10:04:18,119 INFO L130 PetriNetUnfolder]: 1036/3611 cut-off events. [2022-12-13 10:04:18,119 INFO L131 PetriNetUnfolder]: For 235690/236346 co-relation queries the response was YES. [2022-12-13 10:04:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36452 conditions, 3611 events. 1036/3611 cut-off events. For 235690/236346 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 40713 event pairs, 332 based on Foata normal form. 15/3355 useless extension candidates. Maximal degree in co-relation 35809. Up to 765 conditions per place. [2022-12-13 10:04:18,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 628 transitions, 16370 flow [2022-12-13 10:04:18,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 2864 [2022-12-13 10:04:25,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:04:25,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8511 [2022-12-13 10:04:25,983 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 628 transitions, 16434 flow [2022-12-13 10:04:25,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:25,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:04:25,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:04:25,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-13 10:04:26,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:26,189 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:04:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:04:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -135071791, now seen corresponding path program 1 times [2022-12-13 10:04:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:04:26,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52900404] [2022-12-13 10:04:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:04:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:04:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52900404] [2022-12-13 10:04:26,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52900404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:04:26,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626624315] [2022-12-13 10:04:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:26,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:26,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:04:26,231 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:04:26,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-13 10:04:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:26,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:04:26,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:04:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:26,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:04:26,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626624315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:04:26,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:04:26,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:04:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160081245] [2022-12-13 10:04:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:04:26,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:04:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:04:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:04:26,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:04:26,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 10:04:26,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 628 transitions, 16434 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:26,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:04:26,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 10:04:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:04:29,805 INFO L130 PetriNetUnfolder]: 5887/10847 cut-off events. [2022-12-13 10:04:29,805 INFO L131 PetriNetUnfolder]: For 1166976/1166976 co-relation queries the response was YES. [2022-12-13 10:04:29,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142646 conditions, 10847 events. 5887/10847 cut-off events. For 1166976/1166976 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 89122 event pairs, 2993 based on Foata normal form. 37/10878 useless extension candidates. Maximal degree in co-relation 140923. Up to 5960 conditions per place. [2022-12-13 10:04:30,001 INFO L137 encePairwiseOnDemand]: 99/108 looper letters, 730 selfloop transitions, 6 changer transitions 2/738 dead transitions. [2022-12-13 10:04:30,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 738 transitions, 20240 flow [2022-12-13 10:04:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:04:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:04:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-12-13 10:04:30,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-13 10:04:30,002 INFO L175 Difference]: Start difference. First operand has 350 places, 628 transitions, 16434 flow. Second operand 4 states and 152 transitions. [2022-12-13 10:04:30,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 738 transitions, 20240 flow [2022-12-13 10:04:34,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 738 transitions, 20069 flow, removed 67 selfloop flow, removed 2 redundant places. [2022-12-13 10:04:34,082 INFO L231 Difference]: Finished difference. Result has 352 places, 616 transitions, 16078 flow [2022-12-13 10:04:34,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=16090, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=16078, PETRI_PLACES=352, PETRI_TRANSITIONS=616} [2022-12-13 10:04:34,083 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 331 predicate places. [2022-12-13 10:04:34,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:04:34,083 INFO L89 Accepts]: Start accepts. Operand has 352 places, 616 transitions, 16078 flow [2022-12-13 10:04:34,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:04:34,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:04:34,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 352 places, 616 transitions, 16078 flow [2022-12-13 10:04:34,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 616 transitions, 16078 flow [2022-12-13 10:04:34,877 INFO L130 PetriNetUnfolder]: 1178/4089 cut-off events. [2022-12-13 10:04:34,877 INFO L131 PetriNetUnfolder]: For 278185/278956 co-relation queries the response was YES. [2022-12-13 10:04:34,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41841 conditions, 4089 events. 1178/4089 cut-off events. For 278185/278956 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 46837 event pairs, 381 based on Foata normal form. 15/3796 useless extension candidates. Maximal degree in co-relation 41697. Up to 847 conditions per place. [2022-12-13 10:04:34,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 616 transitions, 16078 flow [2022-12-13 10:04:34,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 2770 [2022-12-13 10:04:34,959 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:04:34,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 876 [2022-12-13 10:04:34,959 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 616 transitions, 16078 flow [2022-12-13 10:04:34,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:34,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:04:34,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:04:34,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-13 10:04:35,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-12-13 10:04:35,165 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:04:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:04:35,165 INFO L85 PathProgramCache]: Analyzing trace with hash -689875358, now seen corresponding path program 1 times [2022-12-13 10:04:35,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:04:35,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222676501] [2022-12-13 10:04:35,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:35,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:04:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:04:35,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222676501] [2022-12-13 10:04:35,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222676501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:04:35,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:04:35,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:04:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315162512] [2022-12-13 10:04:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:04:35,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:04:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:04:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:04:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:04:35,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 107 [2022-12-13 10:04:35,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 616 transitions, 16078 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:35,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:04:35,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 107 [2022-12-13 10:04:35,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:04:38,709 INFO L130 PetriNetUnfolder]: 5901/10859 cut-off events. [2022-12-13 10:04:38,709 INFO L131 PetriNetUnfolder]: For 1155940/1155940 co-relation queries the response was YES. [2022-12-13 10:04:38,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142520 conditions, 10859 events. 5901/10859 cut-off events. For 1155940/1155940 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 89431 event pairs, 2980 based on Foata normal form. 2/10857 useless extension candidates. Maximal degree in co-relation 142374. Up to 10846 conditions per place. [2022-12-13 10:04:38,863 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 621 selfloop transitions, 12 changer transitions 2/635 dead transitions. [2022-12-13 10:04:38,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 635 transitions, 17847 flow [2022-12-13 10:04:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:04:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:04:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2022-12-13 10:04:38,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23551401869158878 [2022-12-13 10:04:38,864 INFO L175 Difference]: Start difference. First operand has 351 places, 616 transitions, 16078 flow. Second operand 5 states and 126 transitions. [2022-12-13 10:04:38,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 635 transitions, 17847 flow [2022-12-13 10:04:43,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 635 transitions, 17774 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 10:04:43,328 INFO L231 Difference]: Finished difference. Result has 353 places, 627 transitions, 16446 flow [2022-12-13 10:04:43,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=16007, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16446, PETRI_PLACES=353, PETRI_TRANSITIONS=627} [2022-12-13 10:04:43,329 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 332 predicate places. [2022-12-13 10:04:43,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:04:43,329 INFO L89 Accepts]: Start accepts. Operand has 353 places, 627 transitions, 16446 flow [2022-12-13 10:04:43,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:04:43,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:04:43,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 627 transitions, 16446 flow [2022-12-13 10:04:43,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 352 places, 627 transitions, 16446 flow [2022-12-13 10:04:44,110 INFO L130 PetriNetUnfolder]: 1192/4110 cut-off events. [2022-12-13 10:04:44,111 INFO L131 PetriNetUnfolder]: For 276559/277351 co-relation queries the response was YES. [2022-12-13 10:04:44,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41936 conditions, 4110 events. 1192/4110 cut-off events. For 276559/277351 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 46993 event pairs, 379 based on Foata normal form. 21/3820 useless extension candidates. Maximal degree in co-relation 41764. Up to 851 conditions per place. [2022-12-13 10:04:44,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 352 places, 627 transitions, 16446 flow [2022-12-13 10:04:44,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 2792 [2022-12-13 10:04:44,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] L47-5-->L59-5: Formula: (let ((.cse1 (* 4 v_~i_BA~0_375)) (.cse4 (+ v_~i_BA~0_375 1)) (.cse0 (select |v_#memory_int_549| v_~B~0.base_280)) (.cse2 (select |v_#memory_int_549| v_~A~0.base_285)) (.cse3 (* v_~i_AB~0_459 4))) (and (= (select .cse0 (+ v_~B~0.offset_280 .cse1 4)) (select .cse2 (+ v_~A~0.offset_285 .cse1 4))) (= (select .cse2 (+ v_~A~0.offset_285 .cse1)) (select .cse0 (+ v_~B~0.offset_280 .cse1))) (= v_~i_AB~0_458 (+ 2 v_~i_AB~0_459)) (= (select .cse0 (+ v_~B~0.offset_280 .cse3 4)) (select .cse2 (+ v_~A~0.offset_285 .cse3 4))) (< v_~i_AB~0_458 v_~Bn~0_284) (< v_~i_AB~0_458 v_~An~0_258) (< .cse4 v_~Bn~0_284) (= v_~i_BA~0_373 (+ 2 v_~i_BA~0_375)) (= (select .cse2 (+ (* v_~i_AB~0_458 4) v_~A~0.offset_285)) |v_thread1Thread1of1ForFork1_#t~mem1_408|) (< .cse4 v_~An~0_258) (= (select .cse0 (+ v_~B~0.offset_280 .cse3)) (select .cse2 (+ v_~A~0.offset_285 .cse3))))) InVars {~A~0.base=v_~A~0.base_285, ~B~0.base=v_~B~0.base_280, ~A~0.offset=v_~A~0.offset_285, ~i_AB~0=v_~i_AB~0_459, #memory_int=|v_#memory_int_549|, ~i_BA~0=v_~i_BA~0_375, ~B~0.offset=v_~B~0.offset_280, ~Bn~0=v_~Bn~0_284, ~An~0=v_~An~0_258} OutVars{~A~0.base=v_~A~0.base_285, ~B~0.base=v_~B~0.base_280, ~i_AB~0=v_~i_AB~0_458, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_210|, ~An~0=v_~An~0_258, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_189|, ~A~0.offset=v_~A~0.offset_285, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_408|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_259|, #memory_int=|v_#memory_int_549|, ~i_BA~0=v_~i_BA~0_373, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_262|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_264|, ~B~0.offset=v_~B~0.offset_280, ~Bn~0=v_~Bn~0_284} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:04:44,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:04:44,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1067 [2022-12-13 10:04:44,396 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 627 transitions, 16492 flow [2022-12-13 10:04:44,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:44,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:04:44,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:04:44,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 10:04:44,396 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:04:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:04:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1410554852, now seen corresponding path program 1 times [2022-12-13 10:04:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:04:44,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233114064] [2022-12-13 10:04:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:44,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:04:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:44,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:04:44,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233114064] [2022-12-13 10:04:44,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233114064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:04:44,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723464371] [2022-12-13 10:04:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:44,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:04:44,554 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:04:44,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-13 10:04:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:44,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 10:04:44,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:04:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:44,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:04:44,893 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:04:44,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 92 [2022-12-13 10:04:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:04:44,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723464371] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:04:44,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:04:44,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-13 10:04:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287074925] [2022-12-13 10:04:44,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:04:44,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:04:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:04:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:04:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:04:44,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 109 [2022-12-13 10:04:44,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 627 transitions, 16492 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:44,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:04:44,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 109 [2022-12-13 10:04:44,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:04:48,359 INFO L130 PetriNetUnfolder]: 6032/11090 cut-off events. [2022-12-13 10:04:48,360 INFO L131 PetriNetUnfolder]: For 1178746/1178746 co-relation queries the response was YES. [2022-12-13 10:04:48,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144062 conditions, 11090 events. 6032/11090 cut-off events. For 1178746/1178746 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 91714 event pairs, 2779 based on Foata normal form. 34/11119 useless extension candidates. Maximal degree in co-relation 143305. Up to 10691 conditions per place. [2022-12-13 10:04:48,514 INFO L137 encePairwiseOnDemand]: 80/109 looper letters, 611 selfloop transitions, 60 changer transitions 3/674 dead transitions. [2022-12-13 10:04:48,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 674 transitions, 18486 flow [2022-12-13 10:04:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:04:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:04:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-13 10:04:48,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25382262996941896 [2022-12-13 10:04:48,515 INFO L175 Difference]: Start difference. First operand has 352 places, 627 transitions, 16492 flow. Second operand 6 states and 166 transitions. [2022-12-13 10:04:48,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 674 transitions, 18486 flow [2022-12-13 10:04:53,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 674 transitions, 18433 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 10:04:53,292 INFO L231 Difference]: Finished difference. Result has 357 places, 640 transitions, 16856 flow [2022-12-13 10:04:53,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=16439, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16856, PETRI_PLACES=357, PETRI_TRANSITIONS=640} [2022-12-13 10:04:53,292 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 336 predicate places. [2022-12-13 10:04:53,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:04:53,293 INFO L89 Accepts]: Start accepts. Operand has 357 places, 640 transitions, 16856 flow [2022-12-13 10:04:53,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:04:53,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:04:53,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 640 transitions, 16856 flow [2022-12-13 10:04:53,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 356 places, 640 transitions, 16856 flow [2022-12-13 10:04:54,052 INFO L130 PetriNetUnfolder]: 1223/4222 cut-off events. [2022-12-13 10:04:54,052 INFO L131 PetriNetUnfolder]: For 290637/291450 co-relation queries the response was YES. [2022-12-13 10:04:54,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43120 conditions, 4222 events. 1223/4222 cut-off events. For 290637/291450 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 48537 event pairs, 390 based on Foata normal form. 27/3931 useless extension candidates. Maximal degree in co-relation 42471. Up to 881 conditions per place. [2022-12-13 10:04:54,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 356 places, 640 transitions, 16856 flow [2022-12-13 10:04:54,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 2872 [2022-12-13 10:04:54,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L47-5-->L47-5: Formula: (let ((.cse1 (+ 2 v_~i_AB~0_736)) (.cse0 (+ v_~i_BA~0_586 1)) (.cse5 (* 4 v_~i_BA~0_586)) (.cse4 (select |v_#memory_int_736| v_~B~0.base_401)) (.cse2 (select |v_#memory_int_736| v_~A~0.base_407)) (.cse3 (* v_~i_AB~0_736 4))) (and (< .cse0 v_~An~0_374) (= (+ 3 v_~i_AB~0_736) v_~i_AB~0_734) (< .cse1 v_~Bn~0_400) (= (select .cse2 (+ .cse3 v_~A~0.offset_407)) (select .cse4 (+ v_~B~0.offset_401 .cse3))) (< .cse1 v_~An~0_374) (= (select .cse2 (+ .cse5 v_~A~0.offset_407)) (select .cse4 (+ .cse5 v_~B~0.offset_401))) (< .cse0 v_~Bn~0_400) (= (select .cse4 (+ v_~B~0.offset_401 .cse3 8)) (select .cse2 (+ .cse3 v_~A~0.offset_407 8))) (= (select .cse2 (+ .cse5 v_~A~0.offset_407 4)) (select .cse4 (+ .cse5 v_~B~0.offset_401 4))) (= (+ 2 v_~i_BA~0_586) v_~i_BA~0_585) (= (select .cse4 (+ v_~B~0.offset_401 .cse3 4)) (select .cse2 (+ .cse3 v_~A~0.offset_407 4))))) InVars {~A~0.base=v_~A~0.base_407, ~B~0.base=v_~B~0.base_401, ~A~0.offset=v_~A~0.offset_407, ~i_AB~0=v_~i_AB~0_736, #memory_int=|v_#memory_int_736|, ~i_BA~0=v_~i_BA~0_586, ~B~0.offset=v_~B~0.offset_401, ~Bn~0=v_~Bn~0_400, ~An~0=v_~An~0_374} OutVars{~A~0.base=v_~A~0.base_407, ~B~0.base=v_~B~0.base_401, ~i_AB~0=v_~i_AB~0_734, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_371|, ~An~0=v_~An~0_374, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_308|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_647|, ~A~0.offset=v_~A~0.offset_407, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_431|, #memory_int=|v_#memory_int_736|, ~i_BA~0=v_~i_BA~0_585, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_462|, ~B~0.offset=v_~B~0.offset_401, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_464|, ~Bn~0=v_~Bn~0_400} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:04:54,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:04:54,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1144 [2022-12-13 10:04:54,436 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 640 transitions, 16900 flow [2022-12-13 10:04:54,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:54,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:04:54,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:04:54,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-13 10:04:54,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-12-13 10:04:54,639 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:04:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:04:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 367162926, now seen corresponding path program 1 times [2022-12-13 10:04:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:04:54,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947867007] [2022-12-13 10:04:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:04:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:54,690 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-13 10:04:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:04:54,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947867007] [2022-12-13 10:04:54,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947867007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:04:54,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840565386] [2022-12-13 10:04:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:04:54,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:04:54,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:04:54,692 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:04:54,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-13 10:04:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:04:54,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:04:54,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:04:54,948 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-13 10:04:54,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:04:54,972 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-13 10:04:54,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840565386] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:04:54,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:04:54,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-13 10:04:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133328565] [2022-12-13 10:04:54,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:04:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:04:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:04:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:04:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:04:54,973 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 111 [2022-12-13 10:04:54,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 640 transitions, 16900 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:04:54,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:04:54,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 111 [2022-12-13 10:04:54,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:04:58,927 INFO L130 PetriNetUnfolder]: 6466/11834 cut-off events. [2022-12-13 10:04:58,928 INFO L131 PetriNetUnfolder]: For 1343677/1343677 co-relation queries the response was YES. [2022-12-13 10:04:59,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158621 conditions, 11834 events. 6466/11834 cut-off events. For 1343677/1343677 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 98902 event pairs, 1570 based on Foata normal form. 62/11891 useless extension candidates. Maximal degree in co-relation 156895. Up to 5778 conditions per place. [2022-12-13 10:04:59,105 INFO L137 encePairwiseOnDemand]: 28/111 looper letters, 567 selfloop transitions, 329 changer transitions 2/898 dead transitions. [2022-12-13 10:04:59,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 898 transitions, 24014 flow [2022-12-13 10:04:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:04:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:04:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2022-12-13 10:04:59,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25997425997426 [2022-12-13 10:04:59,106 INFO L175 Difference]: Start difference. First operand has 356 places, 640 transitions, 16900 flow. Second operand 7 states and 202 transitions. [2022-12-13 10:04:59,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 898 transitions, 24014 flow [2022-12-13 10:05:04,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 898 transitions, 23814 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-13 10:05:04,372 INFO L231 Difference]: Finished difference. Result has 363 places, 701 transitions, 19491 flow [2022-12-13 10:05:04,373 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=16757, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19491, PETRI_PLACES=363, PETRI_TRANSITIONS=701} [2022-12-13 10:05:04,373 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 342 predicate places. [2022-12-13 10:05:04,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:05:04,373 INFO L89 Accepts]: Start accepts. Operand has 363 places, 701 transitions, 19491 flow [2022-12-13 10:05:04,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:05:04,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:05:04,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 363 places, 701 transitions, 19491 flow [2022-12-13 10:05:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 701 transitions, 19491 flow [2022-12-13 10:05:05,328 INFO L130 PetriNetUnfolder]: 1313/4421 cut-off events. [2022-12-13 10:05:05,328 INFO L131 PetriNetUnfolder]: For 340866/341831 co-relation queries the response was YES. [2022-12-13 10:05:05,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49614 conditions, 4421 events. 1313/4421 cut-off events. For 340866/341831 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 50681 event pairs, 401 based on Foata normal form. 47/4134 useless extension candidates. Maximal degree in co-relation 48948. Up to 876 conditions per place. [2022-12-13 10:05:05,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 701 transitions, 19491 flow [2022-12-13 10:05:05,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 3052 [2022-12-13 10:05:05,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:05:05,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1056 [2022-12-13 10:05:05,429 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 701 transitions, 19491 flow [2022-12-13 10:05:05,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:05,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:05:05,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:05:05,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-12-13 10:05:05,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:05:05,632 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:05:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:05:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1692453171, now seen corresponding path program 1 times [2022-12-13 10:05:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:05:05,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286776370] [2022-12-13 10:05:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:05,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:05:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:05:05,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286776370] [2022-12-13 10:05:05,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286776370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:05:05,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986110086] [2022-12-13 10:05:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:05,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:05:05,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:05:05,672 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:05:05,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-13 10:05:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:05,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:05:05,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:05:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:05,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:05:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986110086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:05:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:05:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:05:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237756942] [2022-12-13 10:05:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:05:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:05:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:05:05,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:05:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:05:05,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 111 [2022-12-13 10:05:05,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 701 transitions, 19491 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:05,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:05:05,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 111 [2022-12-13 10:05:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:05:09,853 INFO L130 PetriNetUnfolder]: 6414/11806 cut-off events. [2022-12-13 10:05:09,853 INFO L131 PetriNetUnfolder]: For 1374941/1374941 co-relation queries the response was YES. [2022-12-13 10:05:09,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163775 conditions, 11806 events. 6414/11806 cut-off events. For 1374941/1374941 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 98199 event pairs, 3130 based on Foata normal form. 64/11865 useless extension candidates. Maximal degree in co-relation 161970. Up to 6950 conditions per place. [2022-12-13 10:05:10,053 INFO L137 encePairwiseOnDemand]: 102/111 looper letters, 785 selfloop transitions, 11 changer transitions 2/798 dead transitions. [2022-12-13 10:05:10,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 798 transitions, 23200 flow [2022-12-13 10:05:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:05:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:05:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-12-13 10:05:10,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2022-12-13 10:05:10,054 INFO L175 Difference]: Start difference. First operand has 363 places, 701 transitions, 19491 flow. Second operand 4 states and 153 transitions. [2022-12-13 10:05:10,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 798 transitions, 23200 flow [2022-12-13 10:05:15,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 798 transitions, 23140 flow, removed 30 selfloop flow, removed 0 redundant places. [2022-12-13 10:05:16,010 INFO L231 Difference]: Finished difference. Result has 367 places, 693 transitions, 19271 flow [2022-12-13 10:05:16,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=19268, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=19271, PETRI_PLACES=367, PETRI_TRANSITIONS=693} [2022-12-13 10:05:16,010 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2022-12-13 10:05:16,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:05:16,011 INFO L89 Accepts]: Start accepts. Operand has 367 places, 693 transitions, 19271 flow [2022-12-13 10:05:16,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:05:16,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:05:16,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 693 transitions, 19271 flow [2022-12-13 10:05:16,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 693 transitions, 19271 flow [2022-12-13 10:05:16,918 INFO L130 PetriNetUnfolder]: 1302/4449 cut-off events. [2022-12-13 10:05:16,919 INFO L131 PetriNetUnfolder]: For 344109/345012 co-relation queries the response was YES. [2022-12-13 10:05:16,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49755 conditions, 4449 events. 1302/4449 cut-off events. For 344109/345012 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 51343 event pairs, 408 based on Foata normal form. 38/4155 useless extension candidates. Maximal degree in co-relation 49085. Up to 891 conditions per place. [2022-12-13 10:05:17,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 693 transitions, 19271 flow [2022-12-13 10:05:17,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 3024 [2022-12-13 10:05:17,033 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:05:17,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1023 [2022-12-13 10:05:17,033 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 693 transitions, 19271 flow [2022-12-13 10:05:17,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:17,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:05:17,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:05:17,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-12-13 10:05:17,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:05:17,239 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:05:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:05:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 47048053, now seen corresponding path program 1 times [2022-12-13 10:05:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:05:17,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147142571] [2022-12-13 10:05:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:05:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:05:17,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147142571] [2022-12-13 10:05:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147142571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:05:17,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:05:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:05:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197665282] [2022-12-13 10:05:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:05:17,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:05:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:05:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:05:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:05:17,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 111 [2022-12-13 10:05:17,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 693 transitions, 19271 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:17,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:05:17,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 111 [2022-12-13 10:05:17,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:05:21,116 INFO L130 PetriNetUnfolder]: 6440/11843 cut-off events. [2022-12-13 10:05:21,116 INFO L131 PetriNetUnfolder]: For 1374332/1374332 co-relation queries the response was YES. [2022-12-13 10:05:21,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164440 conditions, 11843 events. 6440/11843 cut-off events. For 1374332/1374332 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 98799 event pairs, 2603 based on Foata normal form. 2/11840 useless extension candidates. Maximal degree in co-relation 162629. Up to 11530 conditions per place. [2022-12-13 10:05:21,307 INFO L137 encePairwiseOnDemand]: 73/111 looper letters, 640 selfloop transitions, 66 changer transitions 0/706 dead transitions. [2022-12-13 10:05:21,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 706 transitions, 20993 flow [2022-12-13 10:05:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:05:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:05:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-12-13 10:05:21,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2022-12-13 10:05:21,308 INFO L175 Difference]: Start difference. First operand has 367 places, 693 transitions, 19271 flow. Second operand 3 states and 135 transitions. [2022-12-13 10:05:21,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 706 transitions, 20993 flow [2022-12-13 10:05:27,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 706 transitions, 20967 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:05:27,450 INFO L231 Difference]: Finished difference. Result has 367 places, 696 transitions, 19526 flow [2022-12-13 10:05:27,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=19206, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=19526, PETRI_PLACES=367, PETRI_TRANSITIONS=696} [2022-12-13 10:05:27,451 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2022-12-13 10:05:27,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:05:27,451 INFO L89 Accepts]: Start accepts. Operand has 367 places, 696 transitions, 19526 flow [2022-12-13 10:05:27,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:05:27,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:05:27,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 696 transitions, 19526 flow [2022-12-13 10:05:27,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 696 transitions, 19526 flow [2022-12-13 10:05:28,347 INFO L130 PetriNetUnfolder]: 1302/4462 cut-off events. [2022-12-13 10:05:28,347 INFO L131 PetriNetUnfolder]: For 346298/347109 co-relation queries the response was YES. [2022-12-13 10:05:28,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50053 conditions, 4462 events. 1302/4462 cut-off events. For 346298/347109 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 51392 event pairs, 410 based on Foata normal form. 35/4165 useless extension candidates. Maximal degree in co-relation 49383. Up to 891 conditions per place. [2022-12-13 10:05:28,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 367 places, 696 transitions, 19526 flow [2022-12-13 10:05:28,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 3038 [2022-12-13 10:05:28,453 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:05:28,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1002 [2022-12-13 10:05:28,454 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 696 transitions, 19526 flow [2022-12-13 10:05:28,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:28,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:05:28,454 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:05:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 10:05:28,454 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:05:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:05:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1782994980, now seen corresponding path program 1 times [2022-12-13 10:05:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:05:28,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93568255] [2022-12-13 10:05:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:05:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:05:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93568255] [2022-12-13 10:05:28,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93568255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:05:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833950711] [2022-12-13 10:05:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:05:28,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:05:28,702 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:05:28,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-13 10:05:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:28,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:05:28,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:05:28,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:05:28,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:05:28,990 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:05:28,990 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 23 treesize of output 28 [2022-12-13 10:05:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:29,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:05:29,083 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-13 10:05:29,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 153 [2022-12-13 10:05:29,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:05:29,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2022-12-13 10:05:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:29,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833950711] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:05:29,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:05:29,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:05:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151814301] [2022-12-13 10:05:29,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:05:29,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:05:29,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:05:29,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:05:29,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:05:29,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:05:29,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 696 transitions, 19526 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:29,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:05:29,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:05:29,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:05:33,723 INFO L130 PetriNetUnfolder]: 6622/12209 cut-off events. [2022-12-13 10:05:33,723 INFO L131 PetriNetUnfolder]: For 1413272/1413272 co-relation queries the response was YES. [2022-12-13 10:05:33,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169140 conditions, 12209 events. 6622/12209 cut-off events. For 1413272/1413272 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 102930 event pairs, 1973 based on Foata normal form. 8/12212 useless extension candidates. Maximal degree in co-relation 167333. Up to 11092 conditions per place. [2022-12-13 10:05:33,918 INFO L137 encePairwiseOnDemand]: 40/110 looper letters, 573 selfloop transitions, 206 changer transitions 14/793 dead transitions. [2022-12-13 10:05:33,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 793 transitions, 22956 flow [2022-12-13 10:05:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:05:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:05:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2022-12-13 10:05:33,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19797979797979798 [2022-12-13 10:05:33,919 INFO L175 Difference]: Start difference. First operand has 367 places, 696 transitions, 19526 flow. Second operand 9 states and 196 transitions. [2022-12-13 10:05:33,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 793 transitions, 22956 flow [2022-12-13 10:05:40,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 793 transitions, 22882 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 10:05:40,054 INFO L231 Difference]: Finished difference. Result has 380 places, 746 transitions, 21458 flow [2022-12-13 10:05:40,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=19452, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21458, PETRI_PLACES=380, PETRI_TRANSITIONS=746} [2022-12-13 10:05:40,055 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 359 predicate places. [2022-12-13 10:05:40,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:05:40,055 INFO L89 Accepts]: Start accepts. Operand has 380 places, 746 transitions, 21458 flow [2022-12-13 10:05:40,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:05:40,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:05:40,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 380 places, 746 transitions, 21458 flow [2022-12-13 10:05:40,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 378 places, 746 transitions, 21458 flow [2022-12-13 10:05:40,955 INFO L130 PetriNetUnfolder]: 1324/4572 cut-off events. [2022-12-13 10:05:40,955 INFO L131 PetriNetUnfolder]: For 354048/354956 co-relation queries the response was YES. [2022-12-13 10:05:41,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51396 conditions, 4572 events. 1324/4572 cut-off events. For 354048/354956 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 53230 event pairs, 424 based on Foata normal form. 40/4273 useless extension candidates. Maximal degree in co-relation 51037. Up to 905 conditions per place. [2022-12-13 10:05:41,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 378 places, 746 transitions, 21458 flow [2022-12-13 10:05:41,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 3250 [2022-12-13 10:05:41,071 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:05:41,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1017 [2022-12-13 10:05:41,072 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 746 transitions, 21458 flow [2022-12-13 10:05:41,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:41,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:05:41,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:05:41,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-12-13 10:05:41,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-13 10:05:41,272 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:05:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:05:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1375647409, now seen corresponding path program 1 times [2022-12-13 10:05:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:05:41,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924508205] [2022-12-13 10:05:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:05:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:41,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:05:41,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924508205] [2022-12-13 10:05:41,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924508205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:05:41,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239047219] [2022-12-13 10:05:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:05:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:05:41,673 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:05:41,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-13 10:05:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:41,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:05:41,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:05:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:41,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:05:42,069 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 10:05:42,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 92 [2022-12-13 10:05:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:42,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239047219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:05:42,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:05:42,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-13 10:05:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689321727] [2022-12-13 10:05:42,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:05:42,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:05:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:05:42,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:05:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:05:42,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:05:42,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 746 transitions, 21458 flow. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:42,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:05:42,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:05:42,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:05:47,415 INFO L130 PetriNetUnfolder]: 6880/12651 cut-off events. [2022-12-13 10:05:47,415 INFO L131 PetriNetUnfolder]: For 1505464/1505464 co-relation queries the response was YES. [2022-12-13 10:05:47,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175525 conditions, 12651 events. 6880/12651 cut-off events. For 1505464/1505464 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 106996 event pairs, 3153 based on Foata normal form. 72/12722 useless extension candidates. Maximal degree in co-relation 175130. Up to 11592 conditions per place. [2022-12-13 10:05:47,615 INFO L137 encePairwiseOnDemand]: 67/110 looper letters, 753 selfloop transitions, 134 changer transitions 2/889 dead transitions. [2022-12-13 10:05:47,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 889 transitions, 25629 flow [2022-12-13 10:05:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 10:05:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 10:05:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 259 transitions. [2022-12-13 10:05:47,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1471590909090909 [2022-12-13 10:05:47,616 INFO L175 Difference]: Start difference. First operand has 378 places, 746 transitions, 21458 flow. Second operand 16 states and 259 transitions. [2022-12-13 10:05:47,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 889 transitions, 25629 flow [2022-12-13 10:05:53,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 889 transitions, 25478 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 10:05:53,593 INFO L231 Difference]: Finished difference. Result has 399 places, 788 transitions, 22685 flow [2022-12-13 10:05:53,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=21309, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=22685, PETRI_PLACES=399, PETRI_TRANSITIONS=788} [2022-12-13 10:05:53,594 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 378 predicate places. [2022-12-13 10:05:53,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:05:53,594 INFO L89 Accepts]: Start accepts. Operand has 399 places, 788 transitions, 22685 flow [2022-12-13 10:05:53,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:05:53,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:05:53,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 788 transitions, 22685 flow [2022-12-13 10:05:53,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 399 places, 788 transitions, 22685 flow [2022-12-13 10:05:54,578 INFO L130 PetriNetUnfolder]: 1378/4731 cut-off events. [2022-12-13 10:05:54,578 INFO L131 PetriNetUnfolder]: For 412899/413792 co-relation queries the response was YES. [2022-12-13 10:05:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55270 conditions, 4731 events. 1378/4731 cut-off events. For 412899/413792 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 55448 event pairs, 443 based on Foata normal form. 37/4424 useless extension candidates. Maximal degree in co-relation 54568. Up to 929 conditions per place. [2022-12-13 10:05:54,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 788 transitions, 22685 flow [2022-12-13 10:05:54,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 3486 [2022-12-13 10:05:54,702 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:05:54,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1108 [2022-12-13 10:05:54,703 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 788 transitions, 22685 flow [2022-12-13 10:05:54,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:54,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:05:54,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:05:54,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-12-13 10:05:54,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-13 10:05:54,903 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:05:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:05:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash 6684090, now seen corresponding path program 1 times [2022-12-13 10:05:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:05:54,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960865180] [2022-12-13 10:05:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:05:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:05:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960865180] [2022-12-13 10:05:55,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960865180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:05:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161719611] [2022-12-13 10:05:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:05:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:05:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:05:55,223 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:05:55,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-13 10:05:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:05:55,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:05:55,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:05:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:55,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:05:55,668 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:05:55,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:05:55,700 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:05:55,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:05:55,712 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:05:55,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:05:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:05:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161719611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:05:55,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:05:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:05:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354409760] [2022-12-13 10:05:55,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:05:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:05:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:05:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:05:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:05:55,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:05:55,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 788 transitions, 22685 flow. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:05:55,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:05:55,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:05:55,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:06:00,785 INFO L130 PetriNetUnfolder]: 6888/12667 cut-off events. [2022-12-13 10:06:00,785 INFO L131 PetriNetUnfolder]: For 1649351/1649351 co-relation queries the response was YES. [2022-12-13 10:06:00,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183220 conditions, 12667 events. 6888/12667 cut-off events. For 1649351/1649351 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 107037 event pairs, 2330 based on Foata normal form. 4/12670 useless extension candidates. Maximal degree in co-relation 181348. Up to 12449 conditions per place. [2022-12-13 10:06:00,995 INFO L137 encePairwiseOnDemand]: 36/110 looper letters, 633 selfloop transitions, 178 changer transitions 2/813 dead transitions. [2022-12-13 10:06:00,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 813 transitions, 24692 flow [2022-12-13 10:06:00,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:06:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:06:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2022-12-13 10:06:00,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17575757575757575 [2022-12-13 10:06:00,996 INFO L175 Difference]: Start difference. First operand has 399 places, 788 transitions, 22685 flow. Second operand 9 states and 174 transitions. [2022-12-13 10:06:00,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 813 transitions, 24692 flow [2022-12-13 10:06:08,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 813 transitions, 24344 flow, removed 154 selfloop flow, removed 4 redundant places. [2022-12-13 10:06:08,686 INFO L231 Difference]: Finished difference. Result has 405 places, 792 transitions, 22841 flow [2022-12-13 10:06:08,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=22341, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22841, PETRI_PLACES=405, PETRI_TRANSITIONS=792} [2022-12-13 10:06:08,687 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 384 predicate places. [2022-12-13 10:06:08,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:06:08,687 INFO L89 Accepts]: Start accepts. Operand has 405 places, 792 transitions, 22841 flow [2022-12-13 10:06:08,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:06:08,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:06:08,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 405 places, 792 transitions, 22841 flow [2022-12-13 10:06:08,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 404 places, 792 transitions, 22841 flow [2022-12-13 10:06:09,691 INFO L130 PetriNetUnfolder]: 1379/4703 cut-off events. [2022-12-13 10:06:09,692 INFO L131 PetriNetUnfolder]: For 427309/428266 co-relation queries the response was YES. [2022-12-13 10:06:09,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55462 conditions, 4703 events. 1379/4703 cut-off events. For 427309/428266 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 54810 event pairs, 435 based on Foata normal form. 33/4390 useless extension candidates. Maximal degree in co-relation 55216. Up to 914 conditions per place. [2022-12-13 10:06:09,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 404 places, 792 transitions, 22841 flow [2022-12-13 10:06:09,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 3494 [2022-12-13 10:06:09,817 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:06:09,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1130 [2022-12-13 10:06:09,817 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 792 transitions, 22841 flow [2022-12-13 10:06:09,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:09,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:06:09,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:06:09,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-12-13 10:06:10,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:10,018 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:06:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:06:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1978751768, now seen corresponding path program 2 times [2022-12-13 10:06:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:06:10,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880526412] [2022-12-13 10:06:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:06:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:10,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:06:10,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880526412] [2022-12-13 10:06:10,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880526412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:06:10,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787074757] [2022-12-13 10:06:10,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:06:10,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:06:10,287 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:06:10,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-13 10:06:10,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:06:10,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:06:10,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:06:10,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:06:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:10,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:06:10,860 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:06:10,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:06:10,892 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:06:10,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:06:10,903 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:06:10,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:06:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:10,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787074757] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:06:10,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:06:10,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:06:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322438783] [2022-12-13 10:06:10,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:06:10,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:06:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:06:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:06:10,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:06:10,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:06:10,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 792 transitions, 22841 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:10,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:06:10,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:06:10,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:06:16,273 INFO L130 PetriNetUnfolder]: 6972/12815 cut-off events. [2022-12-13 10:06:16,273 INFO L131 PetriNetUnfolder]: For 1767175/1767175 co-relation queries the response was YES. [2022-12-13 10:06:16,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185175 conditions, 12815 events. 6972/12815 cut-off events. For 1767175/1767175 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 108692 event pairs, 2021 based on Foata normal form. 68/12882 useless extension candidates. Maximal degree in co-relation 184190. Up to 11458 conditions per place. [2022-12-13 10:06:16,494 INFO L137 encePairwiseOnDemand]: 29/110 looper letters, 579 selfloop transitions, 277 changer transitions 3/859 dead transitions. [2022-12-13 10:06:16,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 859 transitions, 25620 flow [2022-12-13 10:06:16,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:06:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:06:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2022-12-13 10:06:16,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.171900826446281 [2022-12-13 10:06:16,495 INFO L175 Difference]: Start difference. First operand has 404 places, 792 transitions, 22841 flow. Second operand 11 states and 208 transitions. [2022-12-13 10:06:16,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 859 transitions, 25620 flow [2022-12-13 10:06:22,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 859 transitions, 25137 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-13 10:06:22,973 INFO L231 Difference]: Finished difference. Result has 409 places, 805 transitions, 23397 flow [2022-12-13 10:06:22,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=22358, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=23397, PETRI_PLACES=409, PETRI_TRANSITIONS=805} [2022-12-13 10:06:22,974 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 388 predicate places. [2022-12-13 10:06:22,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:06:22,974 INFO L89 Accepts]: Start accepts. Operand has 409 places, 805 transitions, 23397 flow [2022-12-13 10:06:22,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:06:22,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:06:22,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 409 places, 805 transitions, 23397 flow [2022-12-13 10:06:22,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 409 places, 805 transitions, 23397 flow [2022-12-13 10:06:24,096 INFO L130 PetriNetUnfolder]: 1396/4790 cut-off events. [2022-12-13 10:06:24,096 INFO L131 PetriNetUnfolder]: For 441333/442274 co-relation queries the response was YES. [2022-12-13 10:06:24,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56530 conditions, 4790 events. 1396/4790 cut-off events. For 441333/442274 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 56259 event pairs, 442 based on Foata normal form. 36/4478 useless extension candidates. Maximal degree in co-relation 55812. Up to 944 conditions per place. [2022-12-13 10:06:24,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 409 places, 805 transitions, 23397 flow [2022-12-13 10:06:24,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 3582 [2022-12-13 10:06:24,248 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:06:24,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1274 [2022-12-13 10:06:24,248 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 805 transitions, 23397 flow [2022-12-13 10:06:24,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:24,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:06:24,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:06:24,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-12-13 10:06:24,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-12-13 10:06:24,449 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:06:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:06:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1067073961, now seen corresponding path program 1 times [2022-12-13 10:06:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:06:24,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350446121] [2022-12-13 10:06:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:06:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:06:24,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350446121] [2022-12-13 10:06:24,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350446121] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:06:24,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870044936] [2022-12-13 10:06:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:24,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:06:24,613 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:06:24,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-13 10:06:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:24,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:06:24,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:06:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:24,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:06:24,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870044936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:06:24,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:06:24,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:06:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677235900] [2022-12-13 10:06:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:06:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:06:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:06:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:06:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:06:24,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:06:24,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 805 transitions, 23397 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:24,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:06:24,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:06:24,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:06:30,256 INFO L130 PetriNetUnfolder]: 7896/14610 cut-off events. [2022-12-13 10:06:30,256 INFO L131 PetriNetUnfolder]: For 2141131/2141131 co-relation queries the response was YES. [2022-12-13 10:06:30,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217228 conditions, 14610 events. 7896/14610 cut-off events. For 2141131/2141131 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 126656 event pairs, 4174 based on Foata normal form. 78/14687 useless extension candidates. Maximal degree in co-relation 215332. Up to 8687 conditions per place. [2022-12-13 10:06:30,513 INFO L137 encePairwiseOnDemand]: 101/110 looper letters, 897 selfloop transitions, 7 changer transitions 1/905 dead transitions. [2022-12-13 10:06:30,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 905 transitions, 27355 flow [2022-12-13 10:06:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:06:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:06:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-12-13 10:06:30,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 10:06:30,514 INFO L175 Difference]: Start difference. First operand has 409 places, 805 transitions, 23397 flow. Second operand 4 states and 176 transitions. [2022-12-13 10:06:30,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 905 transitions, 27355 flow [2022-12-13 10:06:39,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 905 transitions, 26838 flow, removed 52 selfloop flow, removed 6 redundant places. [2022-12-13 10:06:39,811 INFO L231 Difference]: Finished difference. Result has 407 places, 804 transitions, 22896 flow [2022-12-13 10:06:39,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=22862, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=22896, PETRI_PLACES=407, PETRI_TRANSITIONS=804} [2022-12-13 10:06:39,812 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 386 predicate places. [2022-12-13 10:06:39,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:06:39,812 INFO L89 Accepts]: Start accepts. Operand has 407 places, 804 transitions, 22896 flow [2022-12-13 10:06:39,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:06:39,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:06:39,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 407 places, 804 transitions, 22896 flow [2022-12-13 10:06:39,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 407 places, 804 transitions, 22896 flow [2022-12-13 10:06:40,975 INFO L130 PetriNetUnfolder]: 1533/5366 cut-off events. [2022-12-13 10:06:40,975 INFO L131 PetriNetUnfolder]: For 508555/509615 co-relation queries the response was YES. [2022-12-13 10:06:41,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63146 conditions, 5366 events. 1533/5366 cut-off events. For 508555/509615 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 64787 event pairs, 513 based on Foata normal form. 40/5000 useless extension candidates. Maximal degree in co-relation 62328. Up to 1038 conditions per place. [2022-12-13 10:06:41,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 407 places, 804 transitions, 22896 flow [2022-12-13 10:06:41,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 3580 [2022-12-13 10:06:41,237 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:06:41,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1425 [2022-12-13 10:06:41,237 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 804 transitions, 22896 flow [2022-12-13 10:06:41,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:41,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:06:41,237 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:06:41,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-12-13 10:06:41,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:41,438 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:06:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:06:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1277328351, now seen corresponding path program 1 times [2022-12-13 10:06:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:06:41,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658209670] [2022-12-13 10:06:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:06:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:06:41,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658209670] [2022-12-13 10:06:41,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658209670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:06:41,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541115286] [2022-12-13 10:06:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:41,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:41,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:06:41,817 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:06:41,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-13 10:06:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:42,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 10:06:42,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:06:42,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:06:42,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:06:42,136 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 10:06:42,136 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 23 treesize of output 28 [2022-12-13 10:06:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:42,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:06:42,237 INFO L321 Elim1Store]: treesize reduction 15, result has 83.5 percent of original size [2022-12-13 10:06:42,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 153 [2022-12-13 10:06:42,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:06:42,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 55 [2022-12-13 10:06:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:42,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541115286] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:06:42,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:06:42,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 10:06:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951681849] [2022-12-13 10:06:42,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:06:42,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:06:42,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:06:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:06:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:06:42,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:06:42,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 804 transitions, 22896 flow. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:42,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:06:42,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:06:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:06:48,388 INFO L130 PetriNetUnfolder]: 7906/14648 cut-off events. [2022-12-13 10:06:48,389 INFO L131 PetriNetUnfolder]: For 2134806/2134806 co-relation queries the response was YES. [2022-12-13 10:06:48,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216629 conditions, 14648 events. 7906/14648 cut-off events. For 2134806/2134806 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 127191 event pairs, 1818 based on Foata normal form. 8/14655 useless extension candidates. Maximal degree in co-relation 214732. Up to 12511 conditions per place. [2022-12-13 10:06:48,657 INFO L137 encePairwiseOnDemand]: 23/110 looper letters, 459 selfloop transitions, 377 changer transitions 14/850 dead transitions. [2022-12-13 10:06:48,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 850 transitions, 25339 flow [2022-12-13 10:06:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:06:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:06:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2022-12-13 10:06:48,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15272727272727274 [2022-12-13 10:06:48,658 INFO L175 Difference]: Start difference. First operand has 407 places, 804 transitions, 22896 flow. Second operand 10 states and 168 transitions. [2022-12-13 10:06:48,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 850 transitions, 25339 flow [2022-12-13 10:06:57,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 850 transitions, 25327 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:06:57,855 INFO L231 Difference]: Finished difference. Result has 414 places, 804 transitions, 23647 flow [2022-12-13 10:06:57,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=22884, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=376, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23647, PETRI_PLACES=414, PETRI_TRANSITIONS=804} [2022-12-13 10:06:57,856 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 393 predicate places. [2022-12-13 10:06:57,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:06:57,856 INFO L89 Accepts]: Start accepts. Operand has 414 places, 804 transitions, 23647 flow [2022-12-13 10:06:57,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:06:57,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:06:57,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 414 places, 804 transitions, 23647 flow [2022-12-13 10:06:57,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 804 transitions, 23647 flow [2022-12-13 10:06:59,116 INFO L130 PetriNetUnfolder]: 1404/4904 cut-off events. [2022-12-13 10:06:59,117 INFO L131 PetriNetUnfolder]: For 458449/459397 co-relation queries the response was YES. [2022-12-13 10:06:59,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58034 conditions, 4904 events. 1404/4904 cut-off events. For 458449/459397 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 58285 event pairs, 463 based on Foata normal form. 41/4579 useless extension candidates. Maximal degree in co-relation 57313. Up to 956 conditions per place. [2022-12-13 10:06:59,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 412 places, 804 transitions, 23647 flow [2022-12-13 10:06:59,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 3584 [2022-12-13 10:06:59,234 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:06:59,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1379 [2022-12-13 10:06:59,235 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 804 transitions, 23647 flow [2022-12-13 10:06:59,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:59,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:06:59,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:06:59,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-12-13 10:06:59,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:59,436 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:06:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:06:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1134754636, now seen corresponding path program 1 times [2022-12-13 10:06:59,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:06:59,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115364499] [2022-12-13 10:06:59,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:59,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:06:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:06:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115364499] [2022-12-13 10:06:59,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115364499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:06:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22791485] [2022-12-13 10:06:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:06:59,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:06:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:06:59,494 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:06:59,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-13 10:06:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:06:59,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 10:06:59,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:06:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:59,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:06:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:06:59,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22791485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:06:59,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:06:59,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:06:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500086996] [2022-12-13 10:06:59,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:06:59,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:06:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:06:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:06:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:06:59,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 109 [2022-12-13 10:06:59,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 804 transitions, 23647 flow. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:06:59,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:06:59,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 109 [2022-12-13 10:06:59,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:07:05,030 INFO L130 PetriNetUnfolder]: 7302/13470 cut-off events. [2022-12-13 10:07:05,030 INFO L131 PetriNetUnfolder]: For 1957309/1957309 co-relation queries the response was YES. [2022-12-13 10:07:05,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200067 conditions, 13470 events. 7302/13470 cut-off events. For 1957309/1957309 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 115450 event pairs, 2256 based on Foata normal form. 12/13481 useless extension candidates. Maximal degree in co-relation 198148. Up to 6434 conditions per place. [2022-12-13 10:07:05,254 INFO L137 encePairwiseOnDemand]: 36/109 looper letters, 651 selfloop transitions, 382 changer transitions 0/1033 dead transitions. [2022-12-13 10:07:05,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 1033 transitions, 30646 flow [2022-12-13 10:07:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:07:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:07:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2022-12-13 10:07:05,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18623853211009175 [2022-12-13 10:07:05,255 INFO L175 Difference]: Start difference. First operand has 412 places, 804 transitions, 23647 flow. Second operand 10 states and 203 transitions. [2022-12-13 10:07:05,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 1033 transitions, 30646 flow [2022-12-13 10:07:13,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1033 transitions, 30015 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-12-13 10:07:13,380 INFO L231 Difference]: Finished difference. Result has 416 places, 834 transitions, 24950 flow [2022-12-13 10:07:13,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=23025, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24950, PETRI_PLACES=416, PETRI_TRANSITIONS=834} [2022-12-13 10:07:13,380 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 395 predicate places. [2022-12-13 10:07:13,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:07:13,380 INFO L89 Accepts]: Start accepts. Operand has 416 places, 834 transitions, 24950 flow [2022-12-13 10:07:13,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:07:13,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:07:13,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 416 places, 834 transitions, 24950 flow [2022-12-13 10:07:13,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 416 places, 834 transitions, 24950 flow [2022-12-13 10:07:14,554 INFO L130 PetriNetUnfolder]: 1444/4983 cut-off events. [2022-12-13 10:07:14,555 INFO L131 PetriNetUnfolder]: For 485872/486827 co-relation queries the response was YES. [2022-12-13 10:07:14,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61371 conditions, 4983 events. 1444/4983 cut-off events. For 485872/486827 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 59003 event pairs, 471 based on Foata normal form. 33/4642 useless extension candidates. Maximal degree in co-relation 60631. Up to 964 conditions per place. [2022-12-13 10:07:14,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 416 places, 834 transitions, 24950 flow [2022-12-13 10:07:14,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 3686 [2022-12-13 10:07:14,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_291| v_~B~0.base_121)) (.cse3 (* 4 v_~i_BA~0_142)) (.cse2 (select |v_#memory_int_291| v_~A~0.base_133)) (.cse4 (+ v_~i_BA~0_142 1))) (and (< v_~i_AB~0_160 v_~An~0_114) (let ((.cse1 (* v_~i_AB~0_161 4))) (= (select .cse0 (+ v_~B~0.offset_121 .cse1)) (select .cse2 (+ v_~A~0.offset_133 .cse1)))) (= (select .cse2 (+ v_~A~0.offset_133 4 .cse3)) (select .cse0 (+ v_~B~0.offset_121 4 .cse3))) (= (select .cse0 (+ v_~B~0.offset_121 .cse3)) (select .cse2 (+ v_~A~0.offset_133 .cse3))) (= |v_thread1Thread1of1ForFork1_#t~mem1_134| (select .cse2 (+ v_~A~0.offset_133 (* v_~i_AB~0_160 4)))) (< .cse4 v_~An~0_114) (< .cse4 v_~Bn~0_138) (< v_~i_AB~0_160 v_~Bn~0_138) (= (+ 2 v_~i_BA~0_142) v_~i_BA~0_140) (= (+ v_~i_AB~0_161 1) v_~i_AB~0_160))) InVars {~A~0.base=v_~A~0.base_133, ~B~0.base=v_~B~0.base_121, ~A~0.offset=v_~A~0.offset_133, ~i_AB~0=v_~i_AB~0_161, #memory_int=|v_#memory_int_291|, ~i_BA~0=v_~i_BA~0_142, ~B~0.offset=v_~B~0.offset_121, ~Bn~0=v_~Bn~0_138, ~An~0=v_~An~0_114} OutVars{~A~0.base=v_~A~0.base_133, ~B~0.base=v_~B~0.base_121, ~i_AB~0=v_~i_AB~0_160, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_65|, ~An~0=v_~An~0_114, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_53|, ~A~0.offset=v_~A~0.offset_133, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_134|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_94|, #memory_int=|v_#memory_int_291|, ~i_BA~0=v_~i_BA~0_140, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_97|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_99|, ~B~0.offset=v_~B~0.offset_121, ~Bn~0=v_~Bn~0_138} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:07:14,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:07:14,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1357 [2022-12-13 10:07:14,737 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 834 transitions, 24974 flow [2022-12-13 10:07:14,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:07:14,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:07:14,737 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:07:14,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-12-13 10:07:14,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-12-13 10:07:14,942 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:07:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:07:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 520021705, now seen corresponding path program 1 times [2022-12-13 10:07:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:07:14,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285902155] [2022-12-13 10:07:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:07:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:07:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:07:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:07:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:07:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285902155] [2022-12-13 10:07:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285902155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:07:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995334020] [2022-12-13 10:07:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:07:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:07:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:07:15,150 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:07:15,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-13 10:07:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:07:15,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:07:15,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:07:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:07:15,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:07:15,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995334020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:07:15,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:07:15,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:07:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906348744] [2022-12-13 10:07:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:07:15,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:07:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:07:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:07:15,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:07:15,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:07:15,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 834 transitions, 24974 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:07:15,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:07:15,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:07:15,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:07:20,435 INFO L130 PetriNetUnfolder]: 7126/13348 cut-off events. [2022-12-13 10:07:20,435 INFO L131 PetriNetUnfolder]: For 1975394/1975394 co-relation queries the response was YES. [2022-12-13 10:07:20,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201823 conditions, 13348 events. 7126/13348 cut-off events. For 1975394/1975394 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 115149 event pairs, 2980 based on Foata normal form. 222/13569 useless extension candidates. Maximal degree in co-relation 199625. Up to 8552 conditions per place. [2022-12-13 10:07:20,645 INFO L137 encePairwiseOnDemand]: 88/110 looper letters, 752 selfloop transitions, 132 changer transitions 16/900 dead transitions. [2022-12-13 10:07:20,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 900 transitions, 28163 flow [2022-12-13 10:07:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:07:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:07:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-12-13 10:07:20,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2927272727272727 [2022-12-13 10:07:20,646 INFO L175 Difference]: Start difference. First operand has 416 places, 834 transitions, 24974 flow. Second operand 5 states and 161 transitions. [2022-12-13 10:07:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 900 transitions, 28163 flow [2022-12-13 10:07:27,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 900 transitions, 27903 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-12-13 10:07:27,822 INFO L231 Difference]: Finished difference. Result has 415 places, 818 transitions, 24802 flow [2022-12-13 10:07:27,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=24225, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=24802, PETRI_PLACES=415, PETRI_TRANSITIONS=818} [2022-12-13 10:07:27,823 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 394 predicate places. [2022-12-13 10:07:27,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:07:27,823 INFO L89 Accepts]: Start accepts. Operand has 415 places, 818 transitions, 24802 flow [2022-12-13 10:07:27,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:07:27,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:07:27,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 818 transitions, 24802 flow [2022-12-13 10:07:27,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 407 places, 818 transitions, 24802 flow [2022-12-13 10:07:28,848 INFO L130 PetriNetUnfolder]: 1375/4911 cut-off events. [2022-12-13 10:07:28,848 INFO L131 PetriNetUnfolder]: For 478383/479263 co-relation queries the response was YES. [2022-12-13 10:07:28,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60205 conditions, 4911 events. 1375/4911 cut-off events. For 478383/479263 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 58816 event pairs, 471 based on Foata normal form. 28/4566 useless extension candidates. Maximal degree in co-relation 59461. Up to 950 conditions per place. [2022-12-13 10:07:28,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 407 places, 818 transitions, 24802 flow [2022-12-13 10:07:28,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 3686 [2022-12-13 10:07:28,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] L47-1-->L59-5: Formula: (let ((.cse1 (select |v_#memory_int_605| v_~A~0.base_327)) (.cse0 (select |v_#memory_int_605| v_~B~0.base_320))) (and (= (+ v_~i_BA~0_457 1) v_~i_BA~0_456) (= (+ v_~i_AB~0_550 1) v_~i_AB~0_549) (= (select .cse0 (+ v_~B~0.offset_320 (* v_~i_AB~0_550 4))) |v_thread1Thread1of1ForFork1_#t~mem1_488|) (< v_~i_AB~0_549 v_~An~0_296) (= |v_thread1Thread1of1ForFork1_#t~mem1_487| (select .cse1 (+ v_~A~0.offset_327 (* v_~i_AB~0_549 4)))) (< v_~i_BA~0_457 v_~Bn~0_322) (< v_~i_BA~0_457 v_~An~0_296) (< v_~i_AB~0_549 v_~Bn~0_322) (let ((.cse2 (* 4 v_~i_BA~0_457))) (= (select .cse1 (+ v_~A~0.offset_327 .cse2)) (select .cse0 (+ v_~B~0.offset_320 .cse2)))))) InVars {~A~0.base=v_~A~0.base_327, ~B~0.base=v_~B~0.base_320, ~A~0.offset=v_~A~0.offset_327, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_488|, ~i_AB~0=v_~i_AB~0_550, #memory_int=|v_#memory_int_605|, ~i_BA~0=v_~i_BA~0_457, ~B~0.offset=v_~B~0.offset_320, ~Bn~0=v_~Bn~0_322, ~An~0=v_~An~0_296} OutVars{~A~0.base=v_~A~0.base_327, ~B~0.base=v_~B~0.base_320, ~i_AB~0=v_~i_AB~0_549, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_263|, ~An~0=v_~An~0_296, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_233|, ~A~0.offset=v_~A~0.offset_327, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_487|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_313|, #memory_int=|v_#memory_int_605|, ~i_BA~0=v_~i_BA~0_456, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_339|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_341|, ~B~0.offset=v_~B~0.offset_320, ~Bn~0=v_~Bn~0_322} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:07:29,031 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:07:29,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1209 [2022-12-13 10:07:29,032 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 817 transitions, 24796 flow [2022-12-13 10:07:29,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:07:29,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:07:29,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:07:29,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-12-13 10:07:29,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:07:29,232 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:07:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:07:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 250256037, now seen corresponding path program 1 times [2022-12-13 10:07:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:07:29,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977766740] [2022-12-13 10:07:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:07:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:07:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:07:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:07:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:07:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977766740] [2022-12-13 10:07:29,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977766740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:07:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522412280] [2022-12-13 10:07:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:07:29,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:07:29,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:07:29,587 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:07:29,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-13 10:07:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:07:29,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 10:07:29,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:07:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:07:29,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:07:30,006 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:07:30,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:07:30,010 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:07:30,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:07:30,043 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:07:30,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:07:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:07:30,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522412280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:07:30,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:07:30,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 10:07:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049050150] [2022-12-13 10:07:30,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:07:30,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:07:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:07:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:07:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:07:30,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 10:07:30,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 817 transitions, 24796 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:07:30,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:07:30,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 10:07:30,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:07:35,904 INFO L130 PetriNetUnfolder]: 7216/13555 cut-off events. [2022-12-13 10:07:35,905 INFO L131 PetriNetUnfolder]: For 2128702/2128702 co-relation queries the response was YES. [2022-12-13 10:07:36,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204693 conditions, 13555 events. 7216/13555 cut-off events. For 2128702/2128702 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 118315 event pairs, 2054 based on Foata normal form. 214/13768 useless extension candidates. Maximal degree in co-relation 202483. Up to 11663 conditions per place. [2022-12-13 10:07:36,148 INFO L137 encePairwiseOnDemand]: 27/108 looper letters, 585 selfloop transitions, 328 changer transitions 6/919 dead transitions. [2022-12-13 10:07:36,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 919 transitions, 28535 flow [2022-12-13 10:07:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:07:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:07:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 251 transitions. [2022-12-13 10:07:36,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12911522633744857 [2022-12-13 10:07:36,149 INFO L175 Difference]: Start difference. First operand has 406 places, 817 transitions, 24796 flow. Second operand 18 states and 251 transitions. [2022-12-13 10:07:36,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 919 transitions, 28535 flow [2022-12-13 10:07:43,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 919 transitions, 28221 flow, removed 78 selfloop flow, removed 9 redundant places. [2022-12-13 10:07:43,871 INFO L231 Difference]: Finished difference. Result has 418 places, 836 transitions, 25999 flow [2022-12-13 10:07:43,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=24562, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=25999, PETRI_PLACES=418, PETRI_TRANSITIONS=836} [2022-12-13 10:07:43,872 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 397 predicate places. [2022-12-13 10:07:43,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:07:43,872 INFO L89 Accepts]: Start accepts. Operand has 418 places, 836 transitions, 25999 flow [2022-12-13 10:07:43,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:07:43,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:07:43,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 418 places, 836 transitions, 25999 flow [2022-12-13 10:07:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 418 places, 836 transitions, 25999 flow [2022-12-13 10:07:45,003 INFO L130 PetriNetUnfolder]: 1421/5154 cut-off events. [2022-12-13 10:07:45,003 INFO L131 PetriNetUnfolder]: For 505702/506019 co-relation queries the response was YES. [2022-12-13 10:07:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61701 conditions, 5154 events. 1421/5154 cut-off events. For 505702/506019 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 62694 event pairs, 494 based on Foata normal form. 30/4788 useless extension candidates. Maximal degree in co-relation 60974. Up to 1019 conditions per place. [2022-12-13 10:07:45,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 418 places, 836 transitions, 25999 flow [2022-12-13 10:07:45,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 3818 [2022-12-13 10:07:45,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:07:45,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1271 [2022-12-13 10:07:45,143 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 836 transitions, 25999 flow [2022-12-13 10:07:45,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:07:45,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:07:45,143 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:07:45,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-12-13 10:07:45,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:07:45,347 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:07:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:07:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash 69443588, now seen corresponding path program 1 times [2022-12-13 10:07:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:07:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476972025] [2022-12-13 10:07:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:07:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:07:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:07:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:07:45,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:07:45,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476972025] [2022-12-13 10:07:45,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476972025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:07:45,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136076562] [2022-12-13 10:07:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:07:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:07:45,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:07:45,505 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:07:45,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-13 10:07:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:07:45,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 10:07:45,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:07:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:07:45,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:07:45,985 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:07:45,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:07:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:07:46,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136076562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:07:46,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:07:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2022-12-13 10:07:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725046337] [2022-12-13 10:07:46,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:07:46,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:07:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:07:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:07:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:07:46,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 107 [2022-12-13 10:07:46,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 836 transitions, 25999 flow. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:07:46,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:07:46,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 107 [2022-12-13 10:07:46,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:07:52,134 INFO L130 PetriNetUnfolder]: 7633/14276 cut-off events. [2022-12-13 10:07:52,135 INFO L131 PetriNetUnfolder]: For 2266029/2266029 co-relation queries the response was YES. [2022-12-13 10:07:52,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220069 conditions, 14276 events. 7633/14276 cut-off events. For 2266029/2266029 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 125151 event pairs, 1227 based on Foata normal form. 68/14342 useless extension candidates. Maximal degree in co-relation 217871. Up to 9701 conditions per place. [2022-12-13 10:07:52,395 INFO L137 encePairwiseOnDemand]: 19/107 looper letters, 421 selfloop transitions, 563 changer transitions 7/991 dead transitions. [2022-12-13 10:07:52,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 991 transitions, 31849 flow [2022-12-13 10:07:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 10:07:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 10:07:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 269 transitions. [2022-12-13 10:07:52,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12570093457943926 [2022-12-13 10:07:52,397 INFO L175 Difference]: Start difference. First operand has 418 places, 836 transitions, 25999 flow. Second operand 20 states and 269 transitions. [2022-12-13 10:07:52,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 991 transitions, 31849 flow [2022-12-13 10:08:02,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 991 transitions, 31572 flow, removed 62 selfloop flow, removed 6 redundant places. [2022-12-13 10:08:02,767 INFO L231 Difference]: Finished difference. Result has 438 places, 884 transitions, 28708 flow [2022-12-13 10:08:02,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=25722, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=28708, PETRI_PLACES=438, PETRI_TRANSITIONS=884} [2022-12-13 10:08:02,767 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 417 predicate places. [2022-12-13 10:08:02,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:08:02,768 INFO L89 Accepts]: Start accepts. Operand has 438 places, 884 transitions, 28708 flow [2022-12-13 10:08:02,771 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:08:02,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:08:02,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 438 places, 884 transitions, 28708 flow [2022-12-13 10:08:02,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 884 transitions, 28708 flow [2022-12-13 10:08:04,111 INFO L130 PetriNetUnfolder]: 1491/5340 cut-off events. [2022-12-13 10:08:04,111 INFO L131 PetriNetUnfolder]: For 573695/574127 co-relation queries the response was YES. [2022-12-13 10:08:04,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67520 conditions, 5340 events. 1491/5340 cut-off events. For 573695/574127 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 64933 event pairs, 512 based on Foata normal form. 32/4963 useless extension candidates. Maximal degree in co-relation 66783. Up to 1053 conditions per place. [2022-12-13 10:08:04,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 438 places, 884 transitions, 28708 flow [2022-12-13 10:08:04,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 4000 [2022-12-13 10:08:12,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:08:12,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9719 [2022-12-13 10:08:12,487 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 884 transitions, 28781 flow [2022-12-13 10:08:12,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:08:12,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:08:12,487 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:08:12,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-12-13 10:08:12,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:08:12,688 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:08:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:08:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 5598370, now seen corresponding path program 1 times [2022-12-13 10:08:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:08:12,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128849572] [2022-12-13 10:08:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:08:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:08:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:08:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:08:12,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128849572] [2022-12-13 10:08:12,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128849572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:08:12,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656669475] [2022-12-13 10:08:12,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:08:12,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:08:12,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:08:12,732 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:08:12,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-13 10:08:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:08:12,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 10:08:12,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:08:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:13,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:08:13,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656669475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:08:13,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:08:13,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:08:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051460142] [2022-12-13 10:08:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:08:13,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:08:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:08:13,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:08:13,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:08:13,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:08:13,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 884 transitions, 28781 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:08:13,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:08:13,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:08:13,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:08:19,190 INFO L130 PetriNetUnfolder]: 7669/14549 cut-off events. [2022-12-13 10:08:19,191 INFO L131 PetriNetUnfolder]: For 2467190/2467190 co-relation queries the response was YES. [2022-12-13 10:08:19,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231256 conditions, 14549 events. 7669/14549 cut-off events. For 2467190/2467190 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 128838 event pairs, 3485 based on Foata normal form. 234/14780 useless extension candidates. Maximal degree in co-relation 229581. Up to 10066 conditions per place. [2022-12-13 10:08:19,637 INFO L137 encePairwiseOnDemand]: 84/110 looper letters, 765 selfloop transitions, 138 changer transitions 32/935 dead transitions. [2022-12-13 10:08:19,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 935 transitions, 31636 flow [2022-12-13 10:08:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:08:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:08:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-12-13 10:08:19,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2927272727272727 [2022-12-13 10:08:19,638 INFO L175 Difference]: Start difference. First operand has 438 places, 884 transitions, 28781 flow. Second operand 5 states and 161 transitions. [2022-12-13 10:08:19,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 935 transitions, 31636 flow [2022-12-13 10:08:32,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 935 transitions, 30972 flow, removed 111 selfloop flow, removed 11 redundant places. [2022-12-13 10:08:32,677 INFO L231 Difference]: Finished difference. Result has 433 places, 831 transitions, 26972 flow [2022-12-13 10:08:32,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=27307, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=857, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=26972, PETRI_PLACES=433, PETRI_TRANSITIONS=831} [2022-12-13 10:08:32,678 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 412 predicate places. [2022-12-13 10:08:32,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:08:32,679 INFO L89 Accepts]: Start accepts. Operand has 433 places, 831 transitions, 26972 flow [2022-12-13 10:08:32,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:08:32,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:08:32,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 433 places, 831 transitions, 26972 flow [2022-12-13 10:08:32,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 831 transitions, 26972 flow [2022-12-13 10:08:33,958 INFO L130 PetriNetUnfolder]: 1440/5333 cut-off events. [2022-12-13 10:08:33,959 INFO L131 PetriNetUnfolder]: For 574940/575346 co-relation queries the response was YES. [2022-12-13 10:08:34,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66840 conditions, 5333 events. 1440/5333 cut-off events. For 574940/575346 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 65746 event pairs, 527 based on Foata normal form. 22/4927 useless extension candidates. Maximal degree in co-relation 66670. Up to 1059 conditions per place. [2022-12-13 10:08:34,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 425 places, 831 transitions, 26972 flow [2022-12-13 10:08:34,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 3766 [2022-12-13 10:08:34,246 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:08:34,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1569 [2022-12-13 10:08:34,247 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 831 transitions, 26972 flow [2022-12-13 10:08:34,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:08:34,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:08:34,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:08:34,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-12-13 10:08:34,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-12-13 10:08:34,454 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:08:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:08:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2109349386, now seen corresponding path program 1 times [2022-12-13 10:08:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:08:34,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233708965] [2022-12-13 10:08:34,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:08:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:08:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:08:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:08:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233708965] [2022-12-13 10:08:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233708965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:08:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381862545] [2022-12-13 10:08:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:08:34,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:08:34,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:08:34,497 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:08:34,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-13 10:08:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:08:34,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:08:34,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:08:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:34,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:08:34,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381862545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:08:34,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:08:34,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 10:08:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742801924] [2022-12-13 10:08:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:08:34,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:08:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:08:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:08:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:08:34,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 106 [2022-12-13 10:08:34,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 831 transitions, 26972 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:08:34,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:08:34,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 106 [2022-12-13 10:08:34,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:08:41,839 INFO L130 PetriNetUnfolder]: 8733/16531 cut-off events. [2022-12-13 10:08:41,840 INFO L131 PetriNetUnfolder]: For 2870935/2870935 co-relation queries the response was YES. [2022-12-13 10:08:42,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265018 conditions, 16531 events. 8733/16531 cut-off events. For 2870935/2870935 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 148879 event pairs, 4824 based on Foata normal form. 108/16637 useless extension candidates. Maximal degree in co-relation 264846. Up to 9626 conditions per place. [2022-12-13 10:08:42,269 INFO L137 encePairwiseOnDemand]: 93/106 looper letters, 955 selfloop transitions, 16 changer transitions 2/973 dead transitions. [2022-12-13 10:08:42,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 973 transitions, 32752 flow [2022-12-13 10:08:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:08:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:08:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2022-12-13 10:08:42,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3608490566037736 [2022-12-13 10:08:42,270 INFO L175 Difference]: Start difference. First operand has 425 places, 831 transitions, 26972 flow. Second operand 4 states and 153 transitions. [2022-12-13 10:08:42,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 973 transitions, 32752 flow [2022-12-13 10:08:56,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 973 transitions, 32333 flow, removed 120 selfloop flow, removed 11 redundant places. [2022-12-13 10:08:56,827 INFO L231 Difference]: Finished difference. Result has 419 places, 835 transitions, 26860 flow [2022-12-13 10:08:56,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=26609, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=831, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=26860, PETRI_PLACES=419, PETRI_TRANSITIONS=835} [2022-12-13 10:08:56,828 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 398 predicate places. [2022-12-13 10:08:56,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:08:56,828 INFO L89 Accepts]: Start accepts. Operand has 419 places, 835 transitions, 26860 flow [2022-12-13 10:08:56,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:08:56,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:08:56,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 835 transitions, 26860 flow [2022-12-13 10:08:56,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 419 places, 835 transitions, 26860 flow [2022-12-13 10:08:58,206 INFO L130 PetriNetUnfolder]: 1660/6104 cut-off events. [2022-12-13 10:08:58,206 INFO L131 PetriNetUnfolder]: For 623355/623804 co-relation queries the response was YES. [2022-12-13 10:08:58,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75266 conditions, 6104 events. 1660/6104 cut-off events. For 623355/623804 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 76878 event pairs, 617 based on Foata normal form. 25/5631 useless extension candidates. Maximal degree in co-relation 74220. Up to 1216 conditions per place. [2022-12-13 10:08:58,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 835 transitions, 26860 flow [2022-12-13 10:08:58,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 3774 [2022-12-13 10:08:58,373 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:08:58,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1545 [2022-12-13 10:08:58,373 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 835 transitions, 26860 flow [2022-12-13 10:08:58,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:08:58,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:08:58,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:08:58,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-12-13 10:08:58,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:08:58,574 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:08:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:08:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1753878581, now seen corresponding path program 1 times [2022-12-13 10:08:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:08:58,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974178912] [2022-12-13 10:08:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:08:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:08:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:08:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:08:58,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974178912] [2022-12-13 10:08:58,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974178912] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:08:58,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619186263] [2022-12-13 10:08:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:08:58,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:08:58,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:08:58,988 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:08:58,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-13 10:08:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:08:59,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 10:08:59,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:08:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:59,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:08:59,444 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:08:59,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:08:59,457 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:08:59,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:08:59,462 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:08:59,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:08:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:08:59,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619186263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:08:59,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:08:59,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 10:08:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388115296] [2022-12-13 10:08:59,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:08:59,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:08:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:08:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:08:59,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:08:59,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 106 [2022-12-13 10:08:59,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 835 transitions, 26860 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:08:59,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:08:59,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 106 [2022-12-13 10:08:59,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:09:06,696 INFO L130 PetriNetUnfolder]: 9061/17277 cut-off events. [2022-12-13 10:09:06,696 INFO L131 PetriNetUnfolder]: For 2817131/2817131 co-relation queries the response was YES. [2022-12-13 10:09:07,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267269 conditions, 17277 events. 9061/17277 cut-off events. For 2817131/2817131 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 158967 event pairs, 2448 based on Foata normal form. 136/17412 useless extension candidates. Maximal degree in co-relation 264906. Up to 15266 conditions per place. [2022-12-13 10:09:07,125 INFO L137 encePairwiseOnDemand]: 24/106 looper letters, 637 selfloop transitions, 327 changer transitions 1/965 dead transitions. [2022-12-13 10:09:07,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 965 transitions, 31921 flow [2022-12-13 10:09:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:09:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:09:07,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 230 transitions. [2022-12-13 10:09:07,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18081761006289307 [2022-12-13 10:09:07,127 INFO L175 Difference]: Start difference. First operand has 419 places, 835 transitions, 26860 flow. Second operand 12 states and 230 transitions. [2022-12-13 10:09:07,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 965 transitions, 31921 flow [2022-12-13 10:09:20,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 965 transitions, 31901 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:09:20,935 INFO L231 Difference]: Finished difference. Result has 435 places, 899 transitions, 29922 flow [2022-12-13 10:09:20,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=26840, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=29922, PETRI_PLACES=435, PETRI_TRANSITIONS=899} [2022-12-13 10:09:20,936 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 414 predicate places. [2022-12-13 10:09:20,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:09:20,936 INFO L89 Accepts]: Start accepts. Operand has 435 places, 899 transitions, 29922 flow [2022-12-13 10:09:20,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:09:20,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:09:20,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 899 transitions, 29922 flow [2022-12-13 10:09:20,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 899 transitions, 29922 flow [2022-12-13 10:09:22,532 INFO L130 PetriNetUnfolder]: 1737/6505 cut-off events. [2022-12-13 10:09:22,532 INFO L131 PetriNetUnfolder]: For 680858/681385 co-relation queries the response was YES. [2022-12-13 10:09:22,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80126 conditions, 6505 events. 1737/6505 cut-off events. For 680858/681385 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 83318 event pairs, 646 based on Foata normal form. 48/6030 useless extension candidates. Maximal degree in co-relation 79064. Up to 1302 conditions per place. [2022-12-13 10:09:22,722 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 899 transitions, 29922 flow [2022-12-13 10:09:22,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 4060 [2022-12-13 10:09:22,726 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:09:22,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1790 [2022-12-13 10:09:22,726 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 899 transitions, 29922 flow [2022-12-13 10:09:22,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:09:22,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:09:22,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:09:22,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-12-13 10:09:22,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:09:22,932 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:09:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:09:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1824230052, now seen corresponding path program 1 times [2022-12-13 10:09:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:09:22,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039196442] [2022-12-13 10:09:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:09:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:09:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:09:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:09:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:09:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039196442] [2022-12-13 10:09:23,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039196442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:09:23,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:09:23,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:09:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910448297] [2022-12-13 10:09:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:09:23,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:09:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:09:23,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:09:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:09:23,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 106 [2022-12-13 10:09:23,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 899 transitions, 29922 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:09:23,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:09:23,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 106 [2022-12-13 10:09:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:09:30,716 INFO L130 PetriNetUnfolder]: 9048/17218 cut-off events. [2022-12-13 10:09:30,716 INFO L131 PetriNetUnfolder]: For 2909510/2909510 co-relation queries the response was YES. [2022-12-13 10:09:31,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273801 conditions, 17218 events. 9048/17218 cut-off events. For 2909510/2909510 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 157343 event pairs, 5122 based on Foata normal form. 2/17219 useless extension candidates. Maximal degree in co-relation 271421. Up to 17205 conditions per place. [2022-12-13 10:09:31,171 INFO L137 encePairwiseOnDemand]: 95/106 looper letters, 893 selfloop transitions, 12 changer transitions 2/907 dead transitions. [2022-12-13 10:09:31,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 907 transitions, 31871 flow [2022-12-13 10:09:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:09:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:09:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2022-12-13 10:09:31,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2358490566037736 [2022-12-13 10:09:31,172 INFO L175 Difference]: Start difference. First operand has 435 places, 899 transitions, 29922 flow. Second operand 5 states and 125 transitions. [2022-12-13 10:09:31,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 907 transitions, 31871 flow [2022-12-13 10:09:47,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 907 transitions, 31484 flow, removed 112 selfloop flow, removed 3 redundant places. [2022-12-13 10:09:47,149 INFO L231 Difference]: Finished difference. Result has 437 places, 899 transitions, 29564 flow [2022-12-13 10:09:47,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=29535, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=887, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=29564, PETRI_PLACES=437, PETRI_TRANSITIONS=899} [2022-12-13 10:09:47,150 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 416 predicate places. [2022-12-13 10:09:47,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:09:47,150 INFO L89 Accepts]: Start accepts. Operand has 437 places, 899 transitions, 29564 flow [2022-12-13 10:09:47,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:09:47,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:09:47,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 899 transitions, 29564 flow [2022-12-13 10:09:47,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 436 places, 899 transitions, 29564 flow [2022-12-13 10:09:48,776 INFO L130 PetriNetUnfolder]: 1735/6487 cut-off events. [2022-12-13 10:09:48,776 INFO L131 PetriNetUnfolder]: For 699669/700072 co-relation queries the response was YES. [2022-12-13 10:09:48,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80450 conditions, 6487 events. 1735/6487 cut-off events. For 699669/700072 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 83033 event pairs, 644 based on Foata normal form. 48/6014 useless extension candidates. Maximal degree in co-relation 79381. Up to 1297 conditions per place. [2022-12-13 10:09:48,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 436 places, 899 transitions, 29564 flow [2022-12-13 10:09:48,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 4060 [2022-12-13 10:09:48,967 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] L47-5-->L59-5: Formula: (let ((.cse1 (* 4 v_~i_BA~0_375)) (.cse4 (+ v_~i_BA~0_375 1)) (.cse0 (select |v_#memory_int_549| v_~B~0.base_280)) (.cse2 (select |v_#memory_int_549| v_~A~0.base_285)) (.cse3 (* v_~i_AB~0_459 4))) (and (= (select .cse0 (+ v_~B~0.offset_280 .cse1 4)) (select .cse2 (+ v_~A~0.offset_285 .cse1 4))) (= (select .cse2 (+ v_~A~0.offset_285 .cse1)) (select .cse0 (+ v_~B~0.offset_280 .cse1))) (= v_~i_AB~0_458 (+ 2 v_~i_AB~0_459)) (= (select .cse0 (+ v_~B~0.offset_280 .cse3 4)) (select .cse2 (+ v_~A~0.offset_285 .cse3 4))) (< v_~i_AB~0_458 v_~Bn~0_284) (< v_~i_AB~0_458 v_~An~0_258) (< .cse4 v_~Bn~0_284) (= v_~i_BA~0_373 (+ 2 v_~i_BA~0_375)) (= (select .cse2 (+ (* v_~i_AB~0_458 4) v_~A~0.offset_285)) |v_thread1Thread1of1ForFork1_#t~mem1_408|) (< .cse4 v_~An~0_258) (= (select .cse0 (+ v_~B~0.offset_280 .cse3)) (select .cse2 (+ v_~A~0.offset_285 .cse3))))) InVars {~A~0.base=v_~A~0.base_285, ~B~0.base=v_~B~0.base_280, ~A~0.offset=v_~A~0.offset_285, ~i_AB~0=v_~i_AB~0_459, #memory_int=|v_#memory_int_549|, ~i_BA~0=v_~i_BA~0_375, ~B~0.offset=v_~B~0.offset_280, ~Bn~0=v_~Bn~0_284, ~An~0=v_~An~0_258} OutVars{~A~0.base=v_~A~0.base_285, ~B~0.base=v_~B~0.base_280, ~i_AB~0=v_~i_AB~0_458, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_210|, ~An~0=v_~An~0_258, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_189|, ~A~0.offset=v_~A~0.offset_285, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_408|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_259|, #memory_int=|v_#memory_int_549|, ~i_BA~0=v_~i_BA~0_373, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_262|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_264|, ~B~0.offset=v_~B~0.offset_280, ~Bn~0=v_~Bn~0_284} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:09:49,164 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:09:49,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2014 [2022-12-13 10:09:49,164 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 899 transitions, 29616 flow [2022-12-13 10:09:49,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:09:49,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:09:49,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:09:49,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 10:09:49,165 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:09:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:09:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 381269214, now seen corresponding path program 1 times [2022-12-13 10:09:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:09:49,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439231333] [2022-12-13 10:09:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:09:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:09:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:09:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:09:49,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:09:49,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439231333] [2022-12-13 10:09:49,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439231333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:09:49,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:09:49,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:09:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070710119] [2022-12-13 10:09:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:09:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:09:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:09:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:09:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:09:49,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 10:09:49,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 899 transitions, 29616 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:09:49,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:09:49,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 10:09:49,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:09:56,649 INFO L130 PetriNetUnfolder]: 8937/16961 cut-off events. [2022-12-13 10:09:56,649 INFO L131 PetriNetUnfolder]: For 2987724/2987724 co-relation queries the response was YES. [2022-12-13 10:09:56,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272677 conditions, 16961 events. 8937/16961 cut-off events. For 2987724/2987724 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 154176 event pairs, 5026 based on Foata normal form. 4/16964 useless extension candidates. Maximal degree in co-relation 270289. Up to 16706 conditions per place. [2022-12-13 10:09:56,982 INFO L137 encePairwiseOnDemand]: 85/108 looper letters, 860 selfloop transitions, 49 changer transitions 1/910 dead transitions. [2022-12-13 10:09:56,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 910 transitions, 31674 flow [2022-12-13 10:09:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:09:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:09:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-12-13 10:09:56,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 10:09:56,983 INFO L175 Difference]: Start difference. First operand has 436 places, 899 transitions, 29616 flow. Second operand 3 states and 126 transitions. [2022-12-13 10:09:56,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 910 transitions, 31674 flow [2022-12-13 10:10:12,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 910 transitions, 31568 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 10:10:12,741 INFO L231 Difference]: Finished difference. Result has 437 places, 898 transitions, 29618 flow [2022-12-13 10:10:12,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=29351, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=845, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29618, PETRI_PLACES=437, PETRI_TRANSITIONS=898} [2022-12-13 10:10:12,742 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 416 predicate places. [2022-12-13 10:10:12,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:10:12,742 INFO L89 Accepts]: Start accepts. Operand has 437 places, 898 transitions, 29618 flow [2022-12-13 10:10:12,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:10:12,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:10:12,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 898 transitions, 29618 flow [2022-12-13 10:10:12,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 436 places, 898 transitions, 29618 flow [2022-12-13 10:10:14,265 INFO L130 PetriNetUnfolder]: 1715/6360 cut-off events. [2022-12-13 10:10:14,265 INFO L131 PetriNetUnfolder]: For 695189/695562 co-relation queries the response was YES. [2022-12-13 10:10:14,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79602 conditions, 6360 events. 1715/6360 cut-off events. For 695189/695562 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 80933 event pairs, 631 based on Foata normal form. 44/5896 useless extension candidates. Maximal degree in co-relation 78520. Up to 1269 conditions per place. [2022-12-13 10:10:14,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 436 places, 898 transitions, 29618 flow [2022-12-13 10:10:14,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 4052 [2022-12-13 10:10:14,451 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:10:14,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1710 [2022-12-13 10:10:14,452 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 898 transitions, 29618 flow [2022-12-13 10:10:14,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:10:14,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:10:14,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:10:14,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 10:10:14,452 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:10:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:10:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2047136959, now seen corresponding path program 2 times [2022-12-13 10:10:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:10:14,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900875345] [2022-12-13 10:10:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:10:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:10:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:10:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:10:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:10:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900875345] [2022-12-13 10:10:14,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900875345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:10:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828936049] [2022-12-13 10:10:14,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:10:14,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:10:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:10:14,716 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:10:14,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-13 10:10:14,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:10:14,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:10:14,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 10:10:14,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:10:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:10:15,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:10:15,281 INFO L321 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2022-12-13 10:10:15,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 64 [2022-12-13 10:10:15,294 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:10:15,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:10:15,299 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:10:15,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:10:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:10:15,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828936049] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:10:15,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:10:15,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:10:15,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478433585] [2022-12-13 10:10:15,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:10:15,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:10:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:10:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:10:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:10:15,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 10:10:15,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 898 transitions, 29618 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:10:15,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:10:15,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 10:10:15,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:10:22,879 INFO L130 PetriNetUnfolder]: 8910/16840 cut-off events. [2022-12-13 10:10:22,879 INFO L131 PetriNetUnfolder]: For 2976444/2976444 co-relation queries the response was YES. [2022-12-13 10:10:23,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271800 conditions, 16840 events. 8910/16840 cut-off events. For 2976444/2976444 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 152417 event pairs, 2613 based on Foata normal form. 4/16843 useless extension candidates. Maximal degree in co-relation 269411. Up to 16548 conditions per place. [2022-12-13 10:10:23,184 INFO L137 encePairwiseOnDemand]: 33/108 looper letters, 709 selfloop transitions, 210 changer transitions 2/921 dead transitions. [2022-12-13 10:10:23,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 921 transitions, 31749 flow [2022-12-13 10:10:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:10:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:10:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2022-12-13 10:10:23,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18724279835390947 [2022-12-13 10:10:23,185 INFO L175 Difference]: Start difference. First operand has 436 places, 898 transitions, 29618 flow. Second operand 9 states and 182 transitions. [2022-12-13 10:10:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 921 transitions, 31749 flow [2022-12-13 10:10:38,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 921 transitions, 31605 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 10:10:38,939 INFO L231 Difference]: Finished difference. Result has 441 places, 898 transitions, 29908 flow [2022-12-13 10:10:38,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=29476, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29908, PETRI_PLACES=441, PETRI_TRANSITIONS=898} [2022-12-13 10:10:38,940 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 420 predicate places. [2022-12-13 10:10:38,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:10:38,940 INFO L89 Accepts]: Start accepts. Operand has 441 places, 898 transitions, 29908 flow [2022-12-13 10:10:38,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:10:38,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:10:38,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 441 places, 898 transitions, 29908 flow [2022-12-13 10:10:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 898 transitions, 29908 flow [2022-12-13 10:10:40,543 INFO L130 PetriNetUnfolder]: 1705/6265 cut-off events. [2022-12-13 10:10:40,544 INFO L131 PetriNetUnfolder]: For 691415/691824 co-relation queries the response was YES. [2022-12-13 10:10:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78979 conditions, 6265 events. 1705/6265 cut-off events. For 691415/691824 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 79182 event pairs, 624 based on Foata normal form. 44/5807 useless extension candidates. Maximal degree in co-relation 77897. Up to 1248 conditions per place. [2022-12-13 10:10:40,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 440 places, 898 transitions, 29908 flow [2022-12-13 10:10:40,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 4052 [2022-12-13 10:10:40,708 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:10:40,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1769 [2022-12-13 10:10:40,709 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 898 transitions, 29908 flow [2022-12-13 10:10:40,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:10:40,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:10:40,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:10:40,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-12-13 10:10:40,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable93 [2022-12-13 10:10:40,909 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:10:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:10:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash -14710183, now seen corresponding path program 1 times [2022-12-13 10:10:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:10:40,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852931078] [2022-12-13 10:10:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:10:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:10:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:10:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:10:41,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:10:41,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852931078] [2022-12-13 10:10:41,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852931078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:10:41,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851840432] [2022-12-13 10:10:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:10:41,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:10:41,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:10:41,334 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:10:41,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-13 10:10:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:10:41,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 10:10:41,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:10:41,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:10:41,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:10:41,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:10:41,638 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:10:41,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-12-13 10:10:41,641 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-13 10:10:41,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:10:41,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:10:41,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-12-13 10:10:41,679 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-13 10:10:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:10:41,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:10:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:10:41,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851840432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:10:41,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:10:41,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:10:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079566661] [2022-12-13 10:10:41,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:10:41,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 10:10:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:10:41,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 10:10:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=142, Unknown=3, NotChecked=0, Total=182 [2022-12-13 10:10:41,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 108 [2022-12-13 10:10:41,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 898 transitions, 29908 flow. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:10:41,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:10:41,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 108 [2022-12-13 10:10:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:10:50,624 INFO L130 PetriNetUnfolder]: 9219/17387 cut-off events. [2022-12-13 10:10:50,624 INFO L131 PetriNetUnfolder]: For 3118155/3118155 co-relation queries the response was YES. [2022-12-13 10:10:50,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279355 conditions, 17387 events. 9219/17387 cut-off events. For 3118155/3118155 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 157846 event pairs, 4876 based on Foata normal form. 72/17458 useless extension candidates. Maximal degree in co-relation 275780. Up to 16580 conditions per place. [2022-12-13 10:10:50,950 INFO L137 encePairwiseOnDemand]: 79/108 looper letters, 937 selfloop transitions, 101 changer transitions 2/1040 dead transitions. [2022-12-13 10:10:50,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1040 transitions, 34781 flow [2022-12-13 10:10:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 10:10:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 10:10:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 245 transitions. [2022-12-13 10:10:50,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12602880658436214 [2022-12-13 10:10:50,954 INFO L175 Difference]: Start difference. First operand has 440 places, 898 transitions, 29908 flow. Second operand 18 states and 245 transitions. [2022-12-13 10:10:50,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1040 transitions, 34781 flow [2022-12-13 10:11:06,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 1040 transitions, 34343 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 10:11:06,759 INFO L231 Difference]: Finished difference. Result has 461 places, 948 transitions, 31133 flow [2022-12-13 10:11:06,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=29472, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=31133, PETRI_PLACES=461, PETRI_TRANSITIONS=948} [2022-12-13 10:11:06,760 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 440 predicate places. [2022-12-13 10:11:06,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:11:06,760 INFO L89 Accepts]: Start accepts. Operand has 461 places, 948 transitions, 31133 flow [2022-12-13 10:11:06,763 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:11:06,763 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:11:06,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 461 places, 948 transitions, 31133 flow [2022-12-13 10:11:06,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 461 places, 948 transitions, 31133 flow [2022-12-13 10:11:08,477 INFO L130 PetriNetUnfolder]: 1767/6463 cut-off events. [2022-12-13 10:11:08,477 INFO L131 PetriNetUnfolder]: For 799319/799732 co-relation queries the response was YES. [2022-12-13 10:11:08,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83567 conditions, 6463 events. 1767/6463 cut-off events. For 799319/799732 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 82177 event pairs, 649 based on Foata normal form. 42/5988 useless extension candidates. Maximal degree in co-relation 81618. Up to 1293 conditions per place. [2022-12-13 10:11:08,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 461 places, 948 transitions, 31133 flow [2022-12-13 10:11:08,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 4306 [2022-12-13 10:11:12,705 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:11:12,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5946 [2022-12-13 10:11:12,706 INFO L495 AbstractCegarLoop]: Abstraction has has 461 places, 948 transitions, 31217 flow [2022-12-13 10:11:12,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:11:12,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:11:12,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:11:12,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-12-13 10:11:12,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:11:12,907 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:11:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:11:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 651611301, now seen corresponding path program 1 times [2022-12-13 10:11:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:11:12,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719587451] [2022-12-13 10:11:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:11:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:11:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:11:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:11:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:11:13,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719587451] [2022-12-13 10:11:13,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719587451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:11:13,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627421128] [2022-12-13 10:11:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:11:13,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:11:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:11:13,211 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:11:13,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-13 10:11:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:11:13,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 10:11:13,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:11:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:11:13,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:11:13,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:11:13,517 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:11:13,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-12-13 10:11:13,521 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-13 10:11:13,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:11:13,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:11:13,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-12-13 10:11:13,567 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-13 10:11:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:11:13,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:11:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:11:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627421128] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:11:13,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:11:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 10:11:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84061095] [2022-12-13 10:11:13,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:11:13,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:11:13,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:11:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:11:13,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=187, Unknown=7, NotChecked=0, Total=240 [2022-12-13 10:11:13,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-13 10:11:13,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 948 transitions, 31217 flow. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:11:13,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:11:13,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-13 10:11:13,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:11:22,557 INFO L130 PetriNetUnfolder]: 9246/17473 cut-off events. [2022-12-13 10:11:22,557 INFO L131 PetriNetUnfolder]: For 3457644/3457644 co-relation queries the response was YES. [2022-12-13 10:11:22,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292414 conditions, 17473 events. 9246/17473 cut-off events. For 3457644/3457644 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 158559 event pairs, 4967 based on Foata normal form. 65/17537 useless extension candidates. Maximal degree in co-relation 288719. Up to 16652 conditions per place. [2022-12-13 10:11:23,043 INFO L137 encePairwiseOnDemand]: 57/110 looper letters, 913 selfloop transitions, 120 changer transitions 19/1052 dead transitions. [2022-12-13 10:11:23,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1052 transitions, 36240 flow [2022-12-13 10:11:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:11:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:11:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2022-12-13 10:11:23,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1435064935064935 [2022-12-13 10:11:23,044 INFO L175 Difference]: Start difference. First operand has 461 places, 948 transitions, 31217 flow. Second operand 14 states and 221 transitions. [2022-12-13 10:11:23,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1052 transitions, 36240 flow [2022-12-13 10:11:41,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1052 transitions, 35828 flow, removed 192 selfloop flow, removed 5 redundant places. [2022-12-13 10:11:41,077 INFO L231 Difference]: Finished difference. Result has 475 places, 985 transitions, 32940 flow [2022-12-13 10:11:41,078 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=30460, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=32940, PETRI_PLACES=475, PETRI_TRANSITIONS=985} [2022-12-13 10:11:41,078 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 454 predicate places. [2022-12-13 10:11:41,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:11:41,078 INFO L89 Accepts]: Start accepts. Operand has 475 places, 985 transitions, 32940 flow [2022-12-13 10:11:41,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:11:41,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:11:41,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 985 transitions, 32940 flow [2022-12-13 10:11:41,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 472 places, 985 transitions, 32940 flow [2022-12-13 10:11:42,823 INFO L130 PetriNetUnfolder]: 1800/6475 cut-off events. [2022-12-13 10:11:42,824 INFO L131 PetriNetUnfolder]: For 855304/855770 co-relation queries the response was YES. [2022-12-13 10:11:42,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87002 conditions, 6475 events. 1800/6475 cut-off events. For 855304/855770 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 81557 event pairs, 641 based on Foata normal form. 46/6005 useless extension candidates. Maximal degree in co-relation 85640. Up to 1295 conditions per place. [2022-12-13 10:11:43,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 472 places, 985 transitions, 32940 flow [2022-12-13 10:11:43,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 4284 [2022-12-13 10:11:43,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [672] L47-5-->L47-5: Formula: (let ((.cse3 (* v_~i_AB~0_450 4)) (.cse2 (select |v_#memory_int_545| v_~A~0.base_281)) (.cse0 (select |v_#memory_int_545| v_~B~0.base_276))) (and (let ((.cse1 (* 4 v_~i_BA~0_364))) (= (select .cse0 (+ v_~B~0.offset_276 .cse1)) (select .cse2 (+ v_~A~0.offset_281 .cse1)))) (= v_~i_AB~0_448 (+ 3 v_~i_AB~0_450)) (< v_~i_BA~0_364 v_~An~0_254) (= (select .cse2 (+ .cse3 v_~A~0.offset_281)) (select .cse0 (+ .cse3 v_~B~0.offset_276))) (= (select .cse0 (+ .cse3 v_~B~0.offset_276 4)) (select .cse2 (+ .cse3 v_~A~0.offset_281 4))) (< v_~i_BA~0_364 v_~Bn~0_280) (= (+ v_~i_BA~0_364 1) v_~i_BA~0_363) (< v_~i_AB~0_448 (+ v_~An~0_254 1)) (< v_~i_AB~0_448 (+ v_~Bn~0_280 1)) (let ((.cse4 (* v_~i_AB~0_448 4))) (= (select .cse2 (+ v_~A~0.offset_281 .cse4 (- 4))) (select .cse0 (+ v_~B~0.offset_276 .cse4 (- 4))))))) InVars {~A~0.base=v_~A~0.base_281, ~B~0.base=v_~B~0.base_276, ~A~0.offset=v_~A~0.offset_281, ~i_AB~0=v_~i_AB~0_450, #memory_int=|v_#memory_int_545|, ~i_BA~0=v_~i_BA~0_364, ~B~0.offset=v_~B~0.offset_276, ~Bn~0=v_~Bn~0_280, ~An~0=v_~An~0_254} OutVars{~A~0.base=v_~A~0.base_281, ~B~0.base=v_~B~0.base_276, ~i_AB~0=v_~i_AB~0_448, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_204|, ~An~0=v_~An~0_254, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_183|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_402|, ~A~0.offset=v_~A~0.offset_281, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_253|, #memory_int=|v_#memory_int_545|, ~i_BA~0=v_~i_BA~0_363, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_256|, ~B~0.offset=v_~B~0.offset_276, ~Bn~0=v_~Bn~0_280, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_258|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:11:43,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] L47-5-->L80-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_53| |v_#pthreadsForks_76|) (< v_~i_AB~0_83 v_~An~0_72) (= (select (select |v_#memory_int_162| v_~A~0.base_71) (+ (* v_~i_AB~0_83 4) v_~A~0.offset_71)) |v_thread1Thread1of1ForFork1_#t~mem1_59|) (= |v_#pthreadsForks_75| (+ |v_#pthreadsForks_76| 1)) (= (store |v_#memory_int_162| |v_ULTIMATE.start_main_~#t2~0#1.base_51| (store (select |v_#memory_int_162| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) |v_ULTIMATE.start_main_~#t2~0#1.offset_51| |v_ULTIMATE.start_main_#t~pre13#1_53|)) |v_#memory_int_161|) (< v_~i_AB~0_83 v_~Bn~0_88)) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #pthreadsForks=|v_#pthreadsForks_76|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, #memory_int=|v_#memory_int_162|, ~i_AB~0=v_~i_AB~0_83, ~Bn~0=v_~Bn~0_88, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ~An~0=v_~An~0_72} OutVars{~A~0.base=v_~A~0.base_71, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_53|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_59|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~i_AB~0=v_~i_AB~0_83, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_41|, ~An~0=v_~An~0_72, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_59|, ~A~0.offset=v_~A~0.offset_71, #pthreadsForks=|v_#pthreadsForks_75|, #memory_int=|v_#memory_int_161|, ~Bn~0=v_~Bn~0_88, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork1_#t~mem1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:11:43,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [557] L79-4-->L80-3: Formula: (and (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= |v_ULTIMATE.start_main_#t~pre13#1_25| |v_#pthreadsForks_40|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_104| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_25|)) |v_#memory_int_103|)) InVars {#pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_104|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_25|, #pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #memory_int=|v_#memory_int_103|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] and [585] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_86 1) v_~i_AB~0_85) (< v_~i_AB~0_86 v_~Bn~0_90) (let ((.cse0 (* v_~i_AB~0_86 4))) (= (select (select |v_#memory_int_165| v_~B~0.base_69) (+ .cse0 v_~B~0.offset_69)) (select (select |v_#memory_int_165| v_~A~0.base_73) (+ .cse0 v_~A~0.offset_73)))) (< v_~i_AB~0_86 v_~An~0_74)) InVars {~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, ~A~0.offset=v_~A~0.offset_73, ~i_AB~0=v_~i_AB~0_86, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} OutVars{~A~0.base=v_~A~0.base_73, ~B~0.base=v_~B~0.base_69, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_61|, ~A~0.offset=v_~A~0.offset_73, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_47|, ~i_AB~0=v_~i_AB~0_85, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_25|, #memory_int=|v_#memory_int_165|, ~B~0.offset=v_~B~0.offset_69, ~Bn~0=v_~Bn~0_90, ~An~0=v_~An~0_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:11:45,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L59-5-->thread2EXIT: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork0_#res.base_Out_2| 0)) (.cse2 (< v_~i_BA~0_In_1 v_~Bn~0_In_3)) (.cse3 (= |v_thread2Thread1of1ForFork0_#res.offset_Out_2| 0)) (.cse1 (< v_~i_BA~0_In_1 v_~An~0_In_1))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 (= |v_thread2Thread1of1ForFork0_#t~mem4_Out_2| |v_thread2Thread1of1ForFork0_#t~mem4_In_1|) (= |v_thread2Thread1of1ForFork0_#t~mem5_In_1| |v_thread2Thread1of1ForFork0_#t~mem5_Out_2|)) (and .cse0 .cse2 (not (let ((.cse4 (* v_~i_BA~0_In_1 4))) (= (select (select |v_#memory_int_In_1| v_~A~0.base_In_1) (+ .cse4 v_~A~0.offset_In_1)) (select (select |v_#memory_int_In_1| v_~B~0.base_In_1) (+ .cse4 v_~B~0.offset_In_1))))) .cse3 .cse1))) InVars {~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, ~B~0.base=v_~B~0.base_In_1, #memory_int=|v_#memory_int_In_1|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_In_1|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_In_1|, ~An~0=v_~An~0_In_1} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_2|, ~A~0.base=v_~A~0.base_In_1, ~B~0.base=v_~B~0.base_In_1, ~An~0=v_~An~0_In_1, ~A~0.offset=v_~A~0.offset_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_2|, #memory_int=|v_#memory_int_In_1|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_Out_2|, ~i_BA~0=v_~i_BA~0_In_1, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_Out_2|, ~B~0.offset=v_~B~0.offset_In_1, ~Bn~0=v_~Bn~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:11:46,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L47-5-->L47-5: Formula: (let ((.cse1 (+ v_~i_BA~0_661 1)) (.cse3 (* 4 v_~i_BA~0_661)) (.cse4 (select |v_#memory_int_781| v_~B~0.base_425)) (.cse2 (select |v_#memory_int_781| v_~A~0.base_431)) (.cse5 (* v_~i_AB~0_797 4)) (.cse0 (+ 2 v_~i_AB~0_797))) (and (< .cse0 v_~An~0_392) (< .cse1 v_~An~0_392) (= v_~i_AB~0_795 (+ 3 v_~i_AB~0_797)) (< .cse1 v_~Bn~0_418) (= (select .cse2 (+ .cse3 v_~A~0.offset_431)) (select .cse4 (+ v_~B~0.offset_425 .cse3))) (= (select .cse4 (+ v_~B~0.offset_425 .cse5 4)) (select .cse2 (+ v_~A~0.offset_431 .cse5 4))) (= (select .cse2 (+ .cse3 v_~A~0.offset_431 4)) (select .cse4 (+ v_~B~0.offset_425 .cse3 4))) (= (+ 2 v_~i_BA~0_661) v_~i_BA~0_660) (= (select .cse2 (+ v_~A~0.offset_431 .cse5 8)) (select .cse4 (+ v_~B~0.offset_425 .cse5 8))) (= (select .cse4 (+ v_~B~0.offset_425 .cse5)) (select .cse2 (+ v_~A~0.offset_431 .cse5))) (< .cse0 v_~Bn~0_418))) InVars {~A~0.base=v_~A~0.base_431, ~B~0.base=v_~B~0.base_425, ~A~0.offset=v_~A~0.offset_431, ~i_AB~0=v_~i_AB~0_797, #memory_int=|v_#memory_int_781|, ~i_BA~0=v_~i_BA~0_661, ~B~0.offset=v_~B~0.offset_425, ~Bn~0=v_~Bn~0_418, ~An~0=v_~An~0_392} OutVars{~A~0.base=v_~A~0.base_431, ~B~0.base=v_~B~0.base_425, ~i_AB~0=v_~i_AB~0_795, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_415|, ~An~0=v_~An~0_392, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_354|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_703|, ~A~0.offset=v_~A~0.offset_431, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_478|, #memory_int=|v_#memory_int_781|, ~i_BA~0=v_~i_BA~0_660, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_525|, ~B~0.offset=v_~B~0.offset_425, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_527|, ~Bn~0=v_~Bn~0_418} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:11:46,371 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 10:11:46,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5294 [2022-12-13 10:11:46,372 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 981 transitions, 33013 flow [2022-12-13 10:11:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:11:46,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:11:46,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:11:46,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-12-13 10:11:46,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:11:46,572 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:11:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:11:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1307078010, now seen corresponding path program 1 times [2022-12-13 10:11:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:11:46,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602673500] [2022-12-13 10:11:46,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:11:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:11:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:11:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:11:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:11:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602673500] [2022-12-13 10:11:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602673500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:11:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803841528] [2022-12-13 10:11:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:11:46,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:11:46,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:11:46,612 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:11:46,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-13 10:11:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:11:46,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 10:11:46,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:11:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:11:46,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:11:46,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803841528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:11:46,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:11:46,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:11:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971939749] [2022-12-13 10:11:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:11:46,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:11:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:11:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:11:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:11:46,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-13 10:11:46,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 981 transitions, 33013 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:11:46,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:11:46,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-13 10:11:46,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:11:53,740 INFO L130 PetriNetUnfolder]: 7821/14655 cut-off events. [2022-12-13 10:11:53,740 INFO L131 PetriNetUnfolder]: For 2949661/2949661 co-relation queries the response was YES. [2022-12-13 10:11:53,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248622 conditions, 14655 events. 7821/14655 cut-off events. For 2949661/2949661 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 128811 event pairs, 4107 based on Foata normal form. 174/14828 useless extension candidates. Maximal degree in co-relation 246642. Up to 13096 conditions per place. [2022-12-13 10:11:54,054 INFO L137 encePairwiseOnDemand]: 83/115 looper letters, 804 selfloop transitions, 19 changer transitions 131/954 dead transitions. [2022-12-13 10:11:54,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 954 transitions, 33567 flow [2022-12-13 10:11:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:11:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:11:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-12-13 10:11:54,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2747826086956522 [2022-12-13 10:11:54,055 INFO L175 Difference]: Start difference. First operand has 468 places, 981 transitions, 33013 flow. Second operand 5 states and 158 transitions. [2022-12-13 10:11:54,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 954 transitions, 33567 flow [2022-12-13 10:12:07,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 954 transitions, 32840 flow, removed 250 selfloop flow, removed 6 redundant places. [2022-12-13 10:12:07,917 INFO L231 Difference]: Finished difference. Result has 468 places, 798 transitions, 25242 flow [2022-12-13 10:12:07,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=30222, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=902, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=25242, PETRI_PLACES=468, PETRI_TRANSITIONS=798} [2022-12-13 10:12:07,917 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 447 predicate places. [2022-12-13 10:12:07,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:12:07,917 INFO L89 Accepts]: Start accepts. Operand has 468 places, 798 transitions, 25242 flow [2022-12-13 10:12:07,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:12:07,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:12:07,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 468 places, 798 transitions, 25242 flow [2022-12-13 10:12:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 798 transitions, 25242 flow [2022-12-13 10:12:09,105 INFO L130 PetriNetUnfolder]: 1447/5041 cut-off events. [2022-12-13 10:12:09,105 INFO L131 PetriNetUnfolder]: For 677888/678255 co-relation queries the response was YES. [2022-12-13 10:12:09,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68008 conditions, 5041 events. 1447/5041 cut-off events. For 677888/678255 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 59870 event pairs, 492 based on Foata normal form. 32/4677 useless extension candidates. Maximal degree in co-relation 67202. Up to 964 conditions per place. [2022-12-13 10:12:09,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 798 transitions, 25242 flow [2022-12-13 10:12:09,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 3406 [2022-12-13 10:12:09,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_287| v_~A~0.base_129)) (.cse0 (select |v_#memory_int_287| v_~B~0.base_117))) (and (= (+ v_~i_AB~0_151 1) v_~i_AB~0_150) (< v_~i_BA~0_130 (+ v_~An~0_110 1)) (< v_~i_AB~0_151 v_~Bn~0_134) (< v_~i_BA~0_130 (+ v_~Bn~0_134 1)) (let ((.cse1 (* 4 v_~i_BA~0_130))) (= (select .cse0 (+ v_~B~0.offset_117 (- 4) .cse1)) (select .cse2 (+ v_~A~0.offset_129 (- 4) .cse1)))) (let ((.cse3 (* 4 v_~i_BA~0_132))) (= (select .cse0 (+ v_~B~0.offset_117 .cse3)) (select .cse2 (+ v_~A~0.offset_129 .cse3)))) (let ((.cse4 (* v_~i_AB~0_151 4))) (= (select .cse2 (+ v_~A~0.offset_129 .cse4)) (select .cse0 (+ v_~B~0.offset_117 .cse4)))) (< v_~i_AB~0_151 v_~An~0_110) (= (+ 2 v_~i_BA~0_132) v_~i_BA~0_130))) InVars {~A~0.base=v_~A~0.base_129, ~A~0.offset=v_~A~0.offset_129, ~B~0.base=v_~B~0.base_117, #memory_int=|v_#memory_int_287|, ~i_AB~0=v_~i_AB~0_151, ~i_BA~0=v_~i_BA~0_132, ~B~0.offset=v_~B~0.offset_117, ~Bn~0=v_~Bn~0_134, ~An~0=v_~An~0_110} OutVars{~A~0.base=v_~A~0.base_129, ~B~0.base=v_~B~0.base_117, ~i_AB~0=v_~i_AB~0_150, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_59|, ~An~0=v_~An~0_110, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_47|, ~A~0.offset=v_~A~0.offset_129, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_128|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_88|, #memory_int=|v_#memory_int_287|, ~i_BA~0=v_~i_BA~0_130, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_91|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_93|, ~B~0.offset=v_~B~0.offset_117, ~Bn~0=v_~Bn~0_134} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [592] L47-5-->L47-5: Formula: (and (= (+ v_~i_AB~0_116 1) v_~i_AB~0_115) (let ((.cse0 (* v_~i_AB~0_116 4))) (= (select (select |v_#memory_int_210| v_~A~0.base_93) (+ v_~A~0.offset_93 .cse0)) (select (select |v_#memory_int_210| v_~B~0.base_89) (+ v_~B~0.offset_89 .cse0)))) (< v_~i_AB~0_116 v_~Bn~0_104) (< v_~i_AB~0_116 v_~An~0_88)) InVars {~A~0.base=v_~A~0.base_93, ~B~0.base=v_~B~0.base_89, ~A~0.offset=v_~A~0.offset_93, ~i_AB~0=v_~i_AB~0_116, #memory_int=|v_#memory_int_210|, ~B~0.offset=v_~B~0.offset_89, ~Bn~0=v_~Bn~0_104, ~An~0=v_~An~0_88} OutVars{~A~0.base=v_~A~0.base_93, ~B~0.base=v_~B~0.base_89, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_99|, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_73|, ~i_AB~0=v_~i_AB~0_115, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_45|, #memory_int=|v_#memory_int_210|, ~B~0.offset=v_~B~0.offset_89, ~Bn~0=v_~Bn~0_104, ~An~0=v_~An~0_88} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:12:09,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:12:09,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L47-5-->L59-5: Formula: (let ((.cse0 (select |v_#memory_int_291| v_~B~0.base_121)) (.cse3 (* 4 v_~i_BA~0_142)) (.cse2 (select |v_#memory_int_291| v_~A~0.base_133)) (.cse4 (+ v_~i_BA~0_142 1))) (and (< v_~i_AB~0_160 v_~An~0_114) (let ((.cse1 (* v_~i_AB~0_161 4))) (= (select .cse0 (+ v_~B~0.offset_121 .cse1)) (select .cse2 (+ v_~A~0.offset_133 .cse1)))) (= (select .cse2 (+ v_~A~0.offset_133 4 .cse3)) (select .cse0 (+ v_~B~0.offset_121 4 .cse3))) (= (select .cse0 (+ v_~B~0.offset_121 .cse3)) (select .cse2 (+ v_~A~0.offset_133 .cse3))) (= |v_thread1Thread1of1ForFork1_#t~mem1_134| (select .cse2 (+ v_~A~0.offset_133 (* v_~i_AB~0_160 4)))) (< .cse4 v_~An~0_114) (< .cse4 v_~Bn~0_138) (< v_~i_AB~0_160 v_~Bn~0_138) (= (+ 2 v_~i_BA~0_142) v_~i_BA~0_140) (= (+ v_~i_AB~0_161 1) v_~i_AB~0_160))) InVars {~A~0.base=v_~A~0.base_133, ~B~0.base=v_~B~0.base_121, ~A~0.offset=v_~A~0.offset_133, ~i_AB~0=v_~i_AB~0_161, #memory_int=|v_#memory_int_291|, ~i_BA~0=v_~i_BA~0_142, ~B~0.offset=v_~B~0.offset_121, ~Bn~0=v_~Bn~0_138, ~An~0=v_~An~0_114} OutVars{~A~0.base=v_~A~0.base_133, ~B~0.base=v_~B~0.base_121, ~i_AB~0=v_~i_AB~0_160, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_65|, ~An~0=v_~An~0_114, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_53|, ~A~0.offset=v_~A~0.offset_133, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_134|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_94|, #memory_int=|v_#memory_int_291|, ~i_BA~0=v_~i_BA~0_140, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_97|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_99|, ~B~0.offset=v_~B~0.offset_121, ~Bn~0=v_~Bn~0_138} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:12:09,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_619| v_~A~0.base_335)) (.cse0 (select |v_#memory_int_619| v_~B~0.base_328))) (and (< v_~i_AB~0_565 v_~Bn~0_330) (< v_~i_BA~0_461 v_~Bn~0_330) (< v_~i_BA~0_461 v_~An~0_304) (= v_~i_AB~0_565 (+ v_~i_AB~0_566 1)) (let ((.cse1 (* v_~i_AB~0_566 4))) (= (select .cse0 (+ v_~B~0.offset_328 .cse1)) (select .cse2 (+ v_~A~0.offset_335 .cse1)))) (< v_~i_AB~0_565 v_~An~0_304) (= v_~i_BA~0_460 (+ v_~i_BA~0_461 1)) (= |v_thread1Thread1of1ForFork1_#t~mem1_501| (select .cse2 (+ (* v_~i_AB~0_565 4) v_~A~0.offset_335))) (let ((.cse3 (* 4 v_~i_BA~0_461))) (= (select .cse2 (+ v_~A~0.offset_335 .cse3)) (select .cse0 (+ v_~B~0.offset_328 .cse3)))))) InVars {~A~0.base=v_~A~0.base_335, ~B~0.base=v_~B~0.base_328, ~A~0.offset=v_~A~0.offset_335, ~i_AB~0=v_~i_AB~0_566, #memory_int=|v_#memory_int_619|, ~i_BA~0=v_~i_BA~0_461, ~B~0.offset=v_~B~0.offset_328, ~Bn~0=v_~Bn~0_330, ~An~0=v_~An~0_304} OutVars{~A~0.base=v_~A~0.base_335, ~B~0.base=v_~B~0.base_328, ~i_AB~0=v_~i_AB~0_565, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_271|, ~An~0=v_~An~0_304, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_235|, ~A~0.offset=v_~A~0.offset_335, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_501|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_323|, #memory_int=|v_#memory_int_619|, ~i_BA~0=v_~i_BA~0_460, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_341|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_343|, ~B~0.offset=v_~B~0.offset_328, ~Bn~0=v_~Bn~0_330} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [567] L47-1-->L47-5: Formula: (and (= (select (select |v_#memory_int_119| v_~B~0.base_53) (+ (* v_~i_AB~0_60 4) v_~B~0.offset_53)) |v_thread1Thread1of1ForFork1_#t~mem1_36|) (= (+ v_~i_AB~0_60 1) v_~i_AB~0_59)) InVars {thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_36|, ~B~0.base=v_~B~0.base_53, ~i_AB~0=v_~i_AB~0_60, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} OutVars{~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_37|, ~i_AB~0=v_~i_AB~0_59, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_21|, #memory_int=|v_#memory_int_119|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3] [2022-12-13 10:12:09,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_619| v_~A~0.base_335)) (.cse0 (select |v_#memory_int_619| v_~B~0.base_328))) (and (< v_~i_AB~0_565 v_~Bn~0_330) (< v_~i_BA~0_461 v_~Bn~0_330) (< v_~i_BA~0_461 v_~An~0_304) (= v_~i_AB~0_565 (+ v_~i_AB~0_566 1)) (let ((.cse1 (* v_~i_AB~0_566 4))) (= (select .cse0 (+ v_~B~0.offset_328 .cse1)) (select .cse2 (+ v_~A~0.offset_335 .cse1)))) (< v_~i_AB~0_565 v_~An~0_304) (= v_~i_BA~0_460 (+ v_~i_BA~0_461 1)) (= |v_thread1Thread1of1ForFork1_#t~mem1_501| (select .cse2 (+ (* v_~i_AB~0_565 4) v_~A~0.offset_335))) (let ((.cse3 (* 4 v_~i_BA~0_461))) (= (select .cse2 (+ v_~A~0.offset_335 .cse3)) (select .cse0 (+ v_~B~0.offset_328 .cse3)))))) InVars {~A~0.base=v_~A~0.base_335, ~B~0.base=v_~B~0.base_328, ~A~0.offset=v_~A~0.offset_335, ~i_AB~0=v_~i_AB~0_566, #memory_int=|v_#memory_int_619|, ~i_BA~0=v_~i_BA~0_461, ~B~0.offset=v_~B~0.offset_328, ~Bn~0=v_~Bn~0_330, ~An~0=v_~An~0_304} OutVars{~A~0.base=v_~A~0.base_335, ~B~0.base=v_~B~0.base_328, ~i_AB~0=v_~i_AB~0_565, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_271|, ~An~0=v_~An~0_304, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_235|, ~A~0.offset=v_~A~0.offset_335, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_501|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_323|, #memory_int=|v_#memory_int_619|, ~i_BA~0=v_~i_BA~0_460, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_341|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_343|, ~B~0.offset=v_~B~0.offset_328, ~Bn~0=v_~Bn~0_330} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [692] L47-1-->L59-5: Formula: (let ((.cse1 (select |v_#memory_int_603| v_~B~0.base_318))) (and (let ((.cse0 (* 4 v_~i_BA~0_453))) (= (select (select |v_#memory_int_603| v_~A~0.base_325) (+ .cse0 v_~A~0.offset_325)) (select .cse1 (+ .cse0 v_~B~0.offset_318)))) (= (+ v_~i_BA~0_453 1) v_~i_BA~0_452) (= (select .cse1 (+ v_~B~0.offset_318 (* v_~i_AB~0_546 4))) |v_thread1Thread1of1ForFork1_#t~mem1_484|) (= v_~i_AB~0_545 (+ v_~i_AB~0_546 1)) (< v_~i_BA~0_453 v_~Bn~0_320) (< v_~i_BA~0_453 v_~An~0_294))) InVars {~A~0.base=v_~A~0.base_325, ~A~0.offset=v_~A~0.offset_325, ~B~0.base=v_~B~0.base_318, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_484|, #memory_int=|v_#memory_int_603|, ~i_AB~0=v_~i_AB~0_546, ~i_BA~0=v_~i_BA~0_453, ~B~0.offset=v_~B~0.offset_318, ~Bn~0=v_~Bn~0_320, ~An~0=v_~An~0_294} OutVars{~A~0.base=v_~A~0.base_325, ~B~0.base=v_~B~0.base_318, ~i_AB~0=v_~i_AB~0_545, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_261|, ~An~0=v_~An~0_294, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_231|, ~A~0.offset=v_~A~0.offset_325, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_311|, #memory_int=|v_#memory_int_603|, ~i_BA~0=v_~i_BA~0_452, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_337|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_339|, ~B~0.offset=v_~B~0.offset_318, ~Bn~0=v_~Bn~0_320} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:12:09,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] L47-5-->L59-5: Formula: (let ((.cse2 (select |v_#memory_int_699| v_~A~0.base_381)) (.cse0 (select |v_#memory_int_699| v_~B~0.base_375))) (and (let ((.cse1 (* 4 v_~i_BA~0_553))) (= (select .cse0 (+ v_~B~0.offset_375 (- 4) .cse1)) (select .cse2 (+ v_~A~0.offset_381 (- 4) .cse1)))) (let ((.cse3 (* 4 v_~i_BA~0_555))) (= (select .cse0 (+ .cse3 v_~B~0.offset_375)) (select .cse2 (+ .cse3 v_~A~0.offset_381)))) (< v_~i_AB~0_688 v_~An~0_352) (< v_~i_BA~0_553 (+ v_~An~0_352 1)) (= (+ 2 v_~i_BA~0_555) v_~i_BA~0_553) (let ((.cse4 (* v_~i_AB~0_688 4))) (= (select .cse2 (+ .cse4 v_~A~0.offset_381)) (select .cse0 (+ .cse4 v_~B~0.offset_375)))) (< v_~i_BA~0_553 (+ v_~Bn~0_378 1)) (< v_~i_AB~0_688 v_~Bn~0_378) (= v_~i_AB~0_687 (+ v_~i_AB~0_688 1)))) InVars {~A~0.base=v_~A~0.base_381, ~A~0.offset=v_~A~0.offset_381, ~B~0.base=v_~B~0.base_375, #memory_int=|v_#memory_int_699|, ~i_AB~0=v_~i_AB~0_688, ~i_BA~0=v_~i_BA~0_555, ~B~0.offset=v_~B~0.offset_375, ~Bn~0=v_~Bn~0_378, ~An~0=v_~An~0_352} OutVars{~A~0.base=v_~A~0.base_381, ~B~0.base=v_~B~0.base_375, ~i_AB~0=v_~i_AB~0_687, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_347|, ~An~0=v_~An~0_352, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_298|, ~A~0.offset=v_~A~0.offset_381, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_605|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_406|, #memory_int=|v_#memory_int_699|, ~i_BA~0=v_~i_BA~0_553, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_419|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_421|, ~B~0.offset=v_~B~0.offset_375, ~Bn~0=v_~Bn~0_378} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:12:09,971 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 10:12:09,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2055 [2022-12-13 10:12:09,972 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 794 transitions, 25309 flow [2022-12-13 10:12:09,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:12:09,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:12:09,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:12:09,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-12-13 10:12:10,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:12:10,173 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:12:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:12:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash -580993816, now seen corresponding path program 1 times [2022-12-13 10:12:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:12:10,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847977044] [2022-12-13 10:12:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:12:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:12:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:12:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:12:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:12:10,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847977044] [2022-12-13 10:12:10,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847977044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:12:10,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:12:10,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:12:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723147511] [2022-12-13 10:12:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:12:10,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:12:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:12:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:12:10,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:12:10,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 100 [2022-12-13 10:12:10,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 794 transitions, 25309 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:12:10,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:12:10,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 100 [2022-12-13 10:12:10,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:12:17,118 INFO L130 PetriNetUnfolder]: 9044/16779 cut-off events. [2022-12-13 10:12:17,118 INFO L131 PetriNetUnfolder]: For 3346655/3346655 co-relation queries the response was YES. [2022-12-13 10:12:17,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281322 conditions, 16779 events. 9044/16779 cut-off events. For 3346655/3346655 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 149165 event pairs, 4943 based on Foata normal form. 56/16834 useless extension candidates. Maximal degree in co-relation 279718. Up to 10774 conditions per place. [2022-12-13 10:12:17,429 INFO L137 encePairwiseOnDemand]: 84/100 looper letters, 1013 selfloop transitions, 13 changer transitions 5/1031 dead transitions. [2022-12-13 10:12:17,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1031 transitions, 33857 flow [2022-12-13 10:12:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:12:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:12:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-12-13 10:12:17,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4225 [2022-12-13 10:12:17,430 INFO L175 Difference]: Start difference. First operand has 428 places, 794 transitions, 25309 flow. Second operand 4 states and 169 transitions. [2022-12-13 10:12:17,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1031 transitions, 33857 flow [2022-12-13 10:12:33,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 1031 transitions, 32957 flow, removed 234 selfloop flow, removed 30 redundant places. [2022-12-13 10:12:33,081 INFO L231 Difference]: Finished difference. Result has 402 places, 790 transitions, 24505 flow [2022-12-13 10:12:33,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=24660, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=781, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=24505, PETRI_PLACES=402, PETRI_TRANSITIONS=790} [2022-12-13 10:12:33,082 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 381 predicate places. [2022-12-13 10:12:33,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:12:33,082 INFO L89 Accepts]: Start accepts. Operand has 402 places, 790 transitions, 24505 flow [2022-12-13 10:12:33,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:12:33,084 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:12:33,084 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 790 transitions, 24505 flow [2022-12-13 10:12:33,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 398 places, 790 transitions, 24505 flow [2022-12-13 10:12:34,430 INFO L130 PetriNetUnfolder]: 1770/6152 cut-off events. [2022-12-13 10:12:34,431 INFO L131 PetriNetUnfolder]: For 644313/644712 co-relation queries the response was YES. [2022-12-13 10:12:34,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76535 conditions, 6152 events. 1770/6152 cut-off events. For 644313/644712 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 76170 event pairs, 612 based on Foata normal form. 30/5699 useless extension candidates. Maximal degree in co-relation 75203. Up to 1185 conditions per place. [2022-12-13 10:12:34,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 398 places, 790 transitions, 24505 flow [2022-12-13 10:12:34,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 3382 [2022-12-13 10:12:34,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [720] L47-5-->L47-1: Formula: (let ((.cse2 (select |v_#memory_int_697| v_~B~0.base_373)) (.cse0 (select |v_#memory_int_697| v_~A~0.base_379))) (and (= |v_thread1Thread1of1ForFork1_#t~mem1_601| (select .cse0 (+ (* v_~i_AB~0_683 4) v_~A~0.offset_379))) (< v_~i_AB~0_683 v_~Bn~0_376) (let ((.cse1 (* v_~i_AB~0_684 4))) (= (select .cse0 (+ v_~A~0.offset_379 .cse1)) (select .cse2 (+ v_~B~0.offset_373 .cse1)))) (< v_~i_AB~0_683 v_~An~0_350) (< v_~i_BA~0_550 v_~Bn~0_376) (let ((.cse3 (* 4 v_~i_BA~0_550))) (= (select .cse2 (+ v_~B~0.offset_373 .cse3)) (select .cse0 (+ v_~A~0.offset_379 .cse3)))) (= (+ v_~i_BA~0_550 1) v_~i_BA~0_549) (< v_~i_BA~0_550 v_~An~0_350) (= v_~i_AB~0_683 (+ v_~i_AB~0_684 1)))) InVars {~A~0.base=v_~A~0.base_379, ~A~0.offset=v_~A~0.offset_379, ~B~0.base=v_~B~0.base_373, ~i_AB~0=v_~i_AB~0_684, #memory_int=|v_#memory_int_697|, ~i_BA~0=v_~i_BA~0_550, ~Bn~0=v_~Bn~0_376, ~B~0.offset=v_~B~0.offset_373, ~An~0=v_~An~0_350} OutVars{~A~0.base=v_~A~0.base_379, ~B~0.base=v_~B~0.base_373, ~i_AB~0=v_~i_AB~0_683, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_345|, ~An~0=v_~An~0_350, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_296|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_601|, ~A~0.offset=v_~A~0.offset_379, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_404|, #memory_int=|v_#memory_int_697|, ~i_BA~0=v_~i_BA~0_549, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_417|, ~Bn~0=v_~Bn~0_376, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_419|, ~B~0.offset=v_~B~0.offset_373} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:12:34,978 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:12:34,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1897 [2022-12-13 10:12:34,979 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 790 transitions, 24604 flow [2022-12-13 10:12:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:12:34,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:12:34,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:12:34,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 10:12:34,979 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:12:34,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:12:34,979 INFO L85 PathProgramCache]: Analyzing trace with hash 164858225, now seen corresponding path program 1 times [2022-12-13 10:12:34,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:12:34,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007387784] [2022-12-13 10:12:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:12:34,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:12:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:12:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:12:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:12:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007387784] [2022-12-13 10:12:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007387784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:12:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677300422] [2022-12-13 10:12:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:12:35,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:12:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:12:35,385 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:12:35,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-13 10:12:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:12:35,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 10:12:35,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:12:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:12:35,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:12:35,802 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 10:12:35,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 10:12:35,815 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:12:35,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:12:35,821 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 10:12:35,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 10:12:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:12:35,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677300422] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:12:35,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:12:35,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:12:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694610229] [2022-12-13 10:12:35,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:12:35,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:12:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:12:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:12:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:12:35,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 99 [2022-12-13 10:12:35,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 790 transitions, 24604 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:12:35,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:12:35,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 99 [2022-12-13 10:12:35,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:12:42,401 INFO L130 PetriNetUnfolder]: 9022/16727 cut-off events. [2022-12-13 10:12:42,401 INFO L131 PetriNetUnfolder]: For 2671712/2671712 co-relation queries the response was YES. [2022-12-13 10:12:42,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259717 conditions, 16727 events. 9022/16727 cut-off events. For 2671712/2671712 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 148090 event pairs, 4962 based on Foata normal form. 2/16728 useless extension candidates. Maximal degree in co-relation 255407. Up to 16597 conditions per place. [2022-12-13 10:12:42,720 INFO L137 encePairwiseOnDemand]: 46/99 looper letters, 687 selfloop transitions, 119 changer transitions 2/808 dead transitions. [2022-12-13 10:12:42,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 808 transitions, 26418 flow [2022-12-13 10:12:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:12:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:12:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-12-13 10:12:42,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1856060606060606 [2022-12-13 10:12:42,721 INFO L175 Difference]: Start difference. First operand has 399 places, 790 transitions, 24604 flow. Second operand 8 states and 147 transitions. [2022-12-13 10:12:42,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 808 transitions, 26418 flow [2022-12-13 10:12:54,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 808 transitions, 26288 flow, removed 51 selfloop flow, removed 7 redundant places. [2022-12-13 10:12:55,000 INFO L231 Difference]: Finished difference. Result has 401 places, 789 transitions, 24608 flow [2022-12-13 10:12:55,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=24352, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=24608, PETRI_PLACES=401, PETRI_TRANSITIONS=789} [2022-12-13 10:12:55,000 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 380 predicate places. [2022-12-13 10:12:55,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:12:55,001 INFO L89 Accepts]: Start accepts. Operand has 401 places, 789 transitions, 24608 flow [2022-12-13 10:12:55,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:12:55,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:12:55,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 401 places, 789 transitions, 24608 flow [2022-12-13 10:12:55,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 399 places, 789 transitions, 24608 flow [2022-12-13 10:12:56,055 INFO L130 PetriNetUnfolder]: 1463/5079 cut-off events. [2022-12-13 10:12:56,055 INFO L131 PetriNetUnfolder]: For 500882/501171 co-relation queries the response was YES. [2022-12-13 10:12:56,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61740 conditions, 5079 events. 1463/5079 cut-off events. For 500882/501171 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 60485 event pairs, 507 based on Foata normal form. 19/4700 useless extension candidates. Maximal degree in co-relation 61496. Up to 979 conditions per place. [2022-12-13 10:12:56,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 789 transitions, 24608 flow [2022-12-13 10:12:56,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 3380 [2022-12-13 10:12:56,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [673] L47-5-->L59-5: Formula: (let ((.cse1 (* 4 v_~i_BA~0_369)) (.cse2 (select |v_#memory_int_547| v_~A~0.base_283)) (.cse0 (select |v_#memory_int_547| v_~B~0.base_278)) (.cse3 (* v_~i_AB~0_455 4)) (.cse4 (+ v_~i_AB~0_455 1)) (.cse5 (+ v_~i_BA~0_369 1))) (and (= (select .cse0 (+ .cse1 v_~B~0.offset_278 4)) (select .cse2 (+ .cse1 v_~A~0.offset_283 4))) (= (select .cse2 (+ .cse1 v_~A~0.offset_283)) (select .cse0 (+ .cse1 v_~B~0.offset_278))) (= (select .cse0 (+ v_~B~0.offset_278 .cse3)) (select .cse2 (+ v_~A~0.offset_283 .cse3))) (< .cse4 v_~Bn~0_282) (= (select .cse2 (+ v_~A~0.offset_283 .cse3 4)) (select .cse0 (+ v_~B~0.offset_278 .cse3 4))) (= (+ 2 v_~i_AB~0_455) v_~i_AB~0_454) (< .cse5 v_~Bn~0_282) (< .cse4 v_~An~0_256) (< .cse5 v_~An~0_256) (= (+ 2 v_~i_BA~0_369) v_~i_BA~0_367))) InVars {~A~0.base=v_~A~0.base_283, ~A~0.offset=v_~A~0.offset_283, ~B~0.base=v_~B~0.base_278, #memory_int=|v_#memory_int_547|, ~i_AB~0=v_~i_AB~0_455, ~i_BA~0=v_~i_BA~0_369, ~B~0.offset=v_~B~0.offset_278, ~Bn~0=v_~Bn~0_282, ~An~0=v_~An~0_256} OutVars{~A~0.base=v_~A~0.base_283, ~B~0.base=v_~B~0.base_278, ~i_AB~0=v_~i_AB~0_454, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_208|, ~An~0=v_~An~0_256, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_185|, ~A~0.offset=v_~A~0.offset_283, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_406|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_257|, #memory_int=|v_#memory_int_547|, ~i_BA~0=v_~i_BA~0_367, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_258|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_260|, ~B~0.offset=v_~B~0.offset_278, ~Bn~0=v_~Bn~0_282} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [486] L47-5-->L47-1: Formula: (and (< v_~i_AB~0_23 v_~An~0_22) (< v_~i_AB~0_23 v_~Bn~0_18) (= (select (select |v_#memory_int_47| v_~A~0.base_13) (+ (* v_~i_AB~0_23 4) v_~A~0.offset_13)) |v_thread1Thread1of1ForFork1_#t~mem1_15|)) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_15|, ~A~0.offset=v_~A~0.offset_13, ~i_AB~0=v_~i_AB~0_23, #memory_int=|v_#memory_int_47|, ~Bn~0=v_~Bn~0_18, ~An~0=v_~An~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem1] [2022-12-13 10:12:56,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] L47-5-->L47-1: Formula: (let ((.cse3 (+ v_~i_BA~0_773 1)) (.cse1 (* 4 v_~i_BA~0_773)) (.cse0 (select |v_#memory_int_853| v_~B~0.base_477)) (.cse2 (select |v_#memory_int_853| v_~A~0.base_479)) (.cse4 (* v_~i_AB~0_909 4))) (and (< v_~i_AB~0_908 v_~Bn~0_466) (< v_~i_AB~0_908 v_~An~0_440) (= (select .cse0 (+ v_~B~0.offset_477 4 .cse1)) (select .cse2 (+ v_~A~0.offset_479 4 .cse1))) (< .cse3 v_~An~0_440) (= (select .cse0 (+ v_~B~0.offset_477 .cse4 4)) (select .cse2 (+ v_~A~0.offset_479 .cse4 4))) (< .cse3 v_~Bn~0_466) (= (+ 2 v_~i_AB~0_909) v_~i_AB~0_908) (= v_~i_BA~0_772 (+ 2 v_~i_BA~0_773)) (= (select .cse0 (+ v_~B~0.offset_477 .cse1)) (select .cse2 (+ v_~A~0.offset_479 .cse1))) (= |v_thread1Thread1of1ForFork1_#t~mem1_779| (select .cse2 (+ (* v_~i_AB~0_908 4) v_~A~0.offset_479))) (= (select .cse0 (+ v_~B~0.offset_477 .cse4)) (select .cse2 (+ v_~A~0.offset_479 .cse4))))) InVars {~A~0.base=v_~A~0.base_479, ~A~0.offset=v_~A~0.offset_479, ~B~0.base=v_~B~0.base_477, ~i_AB~0=v_~i_AB~0_909, #memory_int=|v_#memory_int_853|, ~i_BA~0=v_~i_BA~0_773, ~Bn~0=v_~Bn~0_466, ~B~0.offset=v_~B~0.offset_477, ~An~0=v_~An~0_440} OutVars{~A~0.base=v_~A~0.base_479, ~B~0.base=v_~B~0.base_477, ~i_AB~0=v_~i_AB~0_908, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_480|, ~An~0=v_~An~0_440, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_419|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_779|, ~A~0.offset=v_~A~0.offset_479, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_543|, #memory_int=|v_#memory_int_853|, ~i_BA~0=v_~i_BA~0_772, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_602|, ~Bn~0=v_~Bn~0_466, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_604|, ~B~0.offset=v_~B~0.offset_477} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:12:56,597 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:12:56,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1597 [2022-12-13 10:12:56,597 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 787 transitions, 24619 flow [2022-12-13 10:12:56,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:12:56,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:12:56,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:12:56,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-12-13 10:12:56,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-12-13 10:12:56,798 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:12:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:12:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -411786168, now seen corresponding path program 1 times [2022-12-13 10:12:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:12:56,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137159449] [2022-12-13 10:12:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:12:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:12:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:12:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:12:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:12:56,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137159449] [2022-12-13 10:12:56,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137159449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:12:56,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220290679] [2022-12-13 10:12:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:12:56,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:12:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:12:56,846 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:12:56,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-13 10:12:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:12:57,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 10:12:57,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:12:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:12:57,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:12:57,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220290679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:12:57,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:12:57,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 10:12:57,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380814261] [2022-12-13 10:12:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:12:57,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:12:57,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:12:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:12:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:12:57,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 98 [2022-12-13 10:12:57,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 787 transitions, 24619 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:12:57,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:12:57,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 98 [2022-12-13 10:12:57,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:13:01,202 INFO L130 PetriNetUnfolder]: 5650/10485 cut-off events. [2022-12-13 10:13:01,202 INFO L131 PetriNetUnfolder]: For 1607123/1607123 co-relation queries the response was YES. [2022-12-13 10:13:01,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161540 conditions, 10485 events. 5650/10485 cut-off events. For 1607123/1607123 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 86793 event pairs, 2843 based on Foata normal form. 202/10686 useless extension candidates. Maximal degree in co-relation 159614. Up to 8411 conditions per place. [2022-12-13 10:13:01,381 INFO L137 encePairwiseOnDemand]: 70/98 looper letters, 692 selfloop transitions, 49 changer transitions 60/801 dead transitions. [2022-12-13 10:13:01,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 801 transitions, 26511 flow [2022-12-13 10:13:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:13:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:13:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 10:13:01,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2979591836734694 [2022-12-13 10:13:01,382 INFO L175 Difference]: Start difference. First operand has 396 places, 787 transitions, 24619 flow. Second operand 5 states and 146 transitions. [2022-12-13 10:13:01,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 801 transitions, 26511 flow [2022-12-13 10:13:08,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 801 transitions, 26134 flow, removed 61 selfloop flow, removed 8 redundant places. [2022-12-13 10:13:08,451 INFO L231 Difference]: Finished difference. Result has 393 places, 694 transitions, 21339 flow [2022-12-13 10:13:08,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=23025, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=21339, PETRI_PLACES=393, PETRI_TRANSITIONS=694} [2022-12-13 10:13:08,452 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 372 predicate places. [2022-12-13 10:13:08,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:13:08,452 INFO L89 Accepts]: Start accepts. Operand has 393 places, 694 transitions, 21339 flow [2022-12-13 10:13:08,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:13:08,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:13:08,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 694 transitions, 21339 flow [2022-12-13 10:13:08,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 379 places, 694 transitions, 21339 flow [2022-12-13 10:13:09,200 INFO L130 PetriNetUnfolder]: 1075/3644 cut-off events. [2022-12-13 10:13:09,200 INFO L131 PetriNetUnfolder]: For 355911/356137 co-relation queries the response was YES. [2022-12-13 10:13:09,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45586 conditions, 3644 events. 1075/3644 cut-off events. For 355911/356137 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 40510 event pairs, 343 based on Foata normal form. 24/3388 useless extension candidates. Maximal degree in co-relation 45235. Up to 680 conditions per place. [2022-12-13 10:13:09,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 694 transitions, 21339 flow [2022-12-13 10:13:09,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 2854 [2022-12-13 10:13:09,291 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:13:09,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 840 [2022-12-13 10:13:09,292 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 694 transitions, 21339 flow [2022-12-13 10:13:09,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:13:09,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:13:09,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:13:09,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-12-13 10:13:09,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-12-13 10:13:09,492 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:13:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:13:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 986236575, now seen corresponding path program 1 times [2022-12-13 10:13:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:13:09,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326510783] [2022-12-13 10:13:09,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:13:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:13:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:13:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:13:09,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:13:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326510783] [2022-12-13 10:13:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326510783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:13:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107067925] [2022-12-13 10:13:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:13:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:13:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:13:09,660 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:13:09,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-13 10:13:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:13:09,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 10:13:09,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:13:09,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:13:09,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:13:09,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:13:09,986 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 10:13:09,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-12-13 10:13:09,989 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-13 10:13:09,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:13:09,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:13:09,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-12-13 10:13:10,028 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-13 10:13:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:13:10,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:13:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:13:10,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107067925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:13:10,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:13:10,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-12-13 10:13:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971960758] [2022-12-13 10:13:10,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:13:10,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:13:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:13:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:13:10,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2022-12-13 10:13:10,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 86 [2022-12-13 10:13:10,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 694 transitions, 21339 flow. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:13:10,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:13:10,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 86 [2022-12-13 10:13:10,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:13:14,107 INFO L130 PetriNetUnfolder]: 5515/10169 cut-off events. [2022-12-13 10:13:14,107 INFO L131 PetriNetUnfolder]: For 1439533/1439533 co-relation queries the response was YES. [2022-12-13 10:13:14,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153285 conditions, 10169 events. 5515/10169 cut-off events. For 1439533/1439533 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 83082 event pairs, 2840 based on Foata normal form. 34/10202 useless extension candidates. Maximal degree in co-relation 152518. Up to 9914 conditions per place. [2022-12-13 10:13:14,271 INFO L137 encePairwiseOnDemand]: 47/86 looper letters, 656 selfloop transitions, 96 changer transitions 2/754 dead transitions. [2022-12-13 10:13:14,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 754 transitions, 24650 flow [2022-12-13 10:13:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:13:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:13:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2022-12-13 10:13:14,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2054263565891473 [2022-12-13 10:13:14,272 INFO L175 Difference]: Start difference. First operand has 379 places, 694 transitions, 21339 flow. Second operand 9 states and 159 transitions. [2022-12-13 10:13:14,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 754 transitions, 24650 flow [2022-12-13 10:13:19,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 754 transitions, 24092 flow, removed 83 selfloop flow, removed 16 redundant places. [2022-12-13 10:13:19,334 INFO L231 Difference]: Finished difference. Result has 376 places, 721 transitions, 22472 flow [2022-12-13 10:13:19,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=20830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22472, PETRI_PLACES=376, PETRI_TRANSITIONS=721} [2022-12-13 10:13:19,334 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 355 predicate places. [2022-12-13 10:13:19,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:13:19,334 INFO L89 Accepts]: Start accepts. Operand has 376 places, 721 transitions, 22472 flow [2022-12-13 10:13:19,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:13:19,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:13:19,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 721 transitions, 22472 flow [2022-12-13 10:13:19,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 376 places, 721 transitions, 22472 flow [2022-12-13 10:13:20,204 INFO L130 PetriNetUnfolder]: 1111/3740 cut-off events. [2022-12-13 10:13:20,204 INFO L131 PetriNetUnfolder]: For 335094/335295 co-relation queries the response was YES. [2022-12-13 10:13:20,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45241 conditions, 3740 events. 1111/3740 cut-off events. For 335094/335295 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 41730 event pairs, 349 based on Foata normal form. 17/3467 useless extension candidates. Maximal degree in co-relation 44013. Up to 696 conditions per place. [2022-12-13 10:13:20,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 376 places, 721 transitions, 22472 flow [2022-12-13 10:13:20,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 2942 [2022-12-13 10:13:20,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L47-5-->L47-5: Formula: (let ((.cse0 (+ v_~i_BA~0_777 1)) (.cse4 (* 4 v_~i_BA~0_777)) (.cse2 (* v_~i_AB~0_914 4)) (.cse3 (select |v_#memory_int_855| v_~B~0.base_479)) (.cse1 (select |v_#memory_int_855| v_~A~0.base_481))) (and (< .cse0 v_~An~0_442) (< v_~i_AB~0_912 (+ v_~Bn~0_468 1)) (= (select .cse1 (+ v_~A~0.offset_481 .cse2)) (select .cse3 (+ v_~B~0.offset_479 .cse2))) (= (select .cse1 (+ v_~A~0.offset_481 .cse4)) (select .cse3 (+ v_~B~0.offset_479 .cse4))) (= v_~i_AB~0_912 (+ 3 v_~i_AB~0_914)) (= (+ 2 v_~i_BA~0_777) v_~i_BA~0_776) (< .cse0 v_~Bn~0_468) (= (select .cse1 (+ v_~A~0.offset_481 .cse4 4)) (select .cse3 (+ v_~B~0.offset_479 .cse4 4))) (= (select .cse1 (+ v_~A~0.offset_481 4 .cse2)) (select .cse3 (+ v_~B~0.offset_479 4 .cse2))) (let ((.cse5 (* v_~i_AB~0_912 4))) (= (select .cse3 (+ v_~B~0.offset_479 (- 4) .cse5)) (select .cse1 (+ v_~A~0.offset_481 (- 4) .cse5)))) (< v_~i_AB~0_912 (+ v_~An~0_442 1)))) InVars {~A~0.base=v_~A~0.base_481, ~B~0.base=v_~B~0.base_479, ~A~0.offset=v_~A~0.offset_481, ~i_AB~0=v_~i_AB~0_914, #memory_int=|v_#memory_int_855|, ~i_BA~0=v_~i_BA~0_777, ~B~0.offset=v_~B~0.offset_479, ~Bn~0=v_~Bn~0_468, ~An~0=v_~An~0_442} OutVars{~A~0.base=v_~A~0.base_481, ~B~0.base=v_~B~0.base_479, ~i_AB~0=v_~i_AB~0_912, thread1Thread1of1ForFork1_#t~post3=|v_thread1Thread1of1ForFork1_#t~post3_482|, ~An~0=v_~An~0_442, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_421|, thread1Thread1of1ForFork1_#t~mem1=|v_thread1Thread1of1ForFork1_#t~mem1_783|, ~A~0.offset=v_~A~0.offset_481, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_545|, #memory_int=|v_#memory_int_855|, ~i_BA~0=v_~i_BA~0_776, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_604|, ~B~0.offset=v_~B~0.offset_479, ~Bn~0=v_~Bn~0_468, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_606|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, thread1Thread1of1ForFork1_#t~mem1, thread1Thread1of1ForFork1_#t~mem2, ~i_AB~0, thread1Thread1of1ForFork1_#t~post3, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] and [540] L59-5-->L59-5: Formula: (and (< v_~i_BA~0_64 v_~Bn~0_44) (let ((.cse0 (* 4 v_~i_BA~0_64))) (= (select (select |v_#memory_int_81| v_~B~0.base_31) (+ v_~B~0.offset_31 .cse0)) (select (select |v_#memory_int_81| v_~A~0.base_35) (+ v_~A~0.offset_35 .cse0)))) (< v_~i_BA~0_64 v_~An~0_46) (= (+ 1 v_~i_BA~0_64) v_~i_BA~0_63)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_64, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_17|, ~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~B~0.base=v_~B~0.base_31, #memory_int=|v_#memory_int_81|, ~i_BA~0=v_~i_BA~0_63, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_37|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_37|, ~B~0.offset=v_~B~0.offset_31, ~Bn~0=v_~Bn~0_44, ~An~0=v_~An~0_46} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6, ~i_BA~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5] [2022-12-13 10:13:20,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:13:20,694 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1360 [2022-12-13 10:13:20,694 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 721 transitions, 22557 flow [2022-12-13 10:13:20,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:13:20,694 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:13:20,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:13:20,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-12-13 10:13:20,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-12-13 10:13:20,894 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:13:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:13:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1636195421, now seen corresponding path program 1 times [2022-12-13 10:13:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:13:20,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053187366] [2022-12-13 10:13:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:13:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:13:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:13:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:13:20,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:13:20,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053187366] [2022-12-13 10:13:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053187366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:13:20,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808377731] [2022-12-13 10:13:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:13:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:13:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:13:20,959 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:13:20,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-13 10:13:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:13:21,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 10:13:21,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:13:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:13:21,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:13:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:13:21,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808377731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:13:21,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:13:21,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:13:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965893587] [2022-12-13 10:13:21,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:13:21,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:13:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:13:21,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:13:21,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:13:21,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 89 [2022-12-13 10:13:21,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 721 transitions, 22557 flow. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:13:21,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:13:21,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 89 [2022-12-13 10:13:21,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 10:13:23,672 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:13:23,672 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:13:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:13:23,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 10:13:23,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-12-13 10:13:23,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-12-13 10:13:23,907 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/89 universal loopers) in iteration 102,while PetriNetUnfolder was constructing finite prefix that currently has 88068 conditions, 5546 events (3246/5545 cut-off events. For 878185/878185 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 44645 event pairs, 932 based on Foata normal form. 130/6456 useless extension candidates. Maximal degree in co-relation 86215. Up to 1798 conditions per place.). [2022-12-13 10:13:23,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 10:13:23,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 10:13:23,909 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:13:23,911 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:13:23,911 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:13:23,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:13:23 BasicIcfg [2022-12-13 10:13:23,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:13:23,913 INFO L158 Benchmark]: Toolchain (without parser) took 800949.96ms. Allocated memory was 206.6MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 183.1MB in the beginning and 987.8MB in the end (delta: -804.7MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.59ms. Allocated memory is still 206.6MB. Free memory was 182.9MB in the beginning and 171.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.16ms. Allocated memory is still 206.6MB. Free memory was 171.4MB in the beginning and 169.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L158 Benchmark]: Boogie Preprocessor took 34.76ms. Allocated memory is still 206.6MB. Free memory was 169.8MB in the beginning and 168.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L158 Benchmark]: RCFGBuilder took 415.00ms. Allocated memory is still 206.6MB. Free memory was 168.3MB in the beginning and 151.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L158 Benchmark]: TraceAbstraction took 800219.49ms. Allocated memory was 206.6MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 150.4MB in the beginning and 987.8MB in the end (delta: -837.3MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-12-13 10:13:23,913 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.59ms. Allocated memory is still 206.6MB. Free memory was 182.9MB in the beginning and 171.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.16ms. Allocated memory is still 206.6MB. Free memory was 171.4MB in the beginning and 169.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.76ms. Allocated memory is still 206.6MB. Free memory was 169.8MB in the beginning and 168.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 415.00ms. Allocated memory is still 206.6MB. Free memory was 168.3MB in the beginning and 151.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 800219.49ms. Allocated memory was 206.6MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 150.4MB in the beginning and 987.8MB in the end (delta: -837.3MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 141 PlacesBefore, 21 PlacesAfterwards, 149 TransitionsBefore, 19 TransitionsAfterwards, 992 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 90 TrivialYvCompositions, 30 ConcurrentYvCompositions, 9 ChoiceCompositions, 129 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 627, independent: 615, independent conditional: 615, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 585, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 585, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 627, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 585, unknown conditional: 585, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 601, Positive conditional cache size: 601, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 23 PlacesBefore, 22 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 27 PlacesBefore, 26 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 7, Positive conditional cache size: 7, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 17, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 19, Positive conditional cache size: 19, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 65 PlacesBefore, 65 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 26, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 68 PlacesBefore, 68 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 26, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 26, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 26, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 67 PlacesBefore, 67 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 26, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 26, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 70 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 61 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 72 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 32, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 32, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 79 PlacesBefore, 79 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 35, Positive conditional cache size: 35, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 98 PlacesBefore, 98 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 118 PlacesBefore, 114 PlacesAfterwards, 176 TransitionsBefore, 172 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 56, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 120 PlacesBefore, 119 PlacesAfterwards, 185 TransitionsBefore, 184 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 53, Positive conditional cache size: 53, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 130 PlacesBefore, 130 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 842 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 53, Positive conditional cache size: 53, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 135 PlacesBefore, 135 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 53, Positive conditional cache size: 53, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 137 PlacesBefore, 137 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 53, Positive conditional cache size: 53, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 145 PlacesBefore, 142 PlacesAfterwards, 214 TransitionsBefore, 212 TransitionsAfterwards, 874 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 216 TransitionsBefore, 216 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 142 PlacesBefore, 142 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 149 PlacesBefore, 149 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 882 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 157 PlacesAfterwards, 235 TransitionsBefore, 235 TransitionsAfterwards, 976 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 159 PlacesBefore, 159 PlacesAfterwards, 236 TransitionsBefore, 236 TransitionsAfterwards, 986 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 176 PlacesBefore, 176 PlacesAfterwards, 306 TransitionsBefore, 306 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 61, Positive conditional cache size: 61, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 190 PlacesBefore, 190 PlacesAfterwards, 311 TransitionsBefore, 311 TransitionsAfterwards, 1470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 193 PlacesBefore, 193 PlacesAfterwards, 326 TransitionsBefore, 326 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 198 PlacesBefore, 198 PlacesAfterwards, 332 TransitionsBefore, 332 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 199 PlacesBefore, 199 PlacesAfterwards, 353 TransitionsBefore, 353 TransitionsAfterwards, 1638 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 207 PlacesBefore, 207 PlacesAfterwards, 353 TransitionsBefore, 353 TransitionsAfterwards, 1638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 211 PlacesBefore, 211 PlacesAfterwards, 383 TransitionsBefore, 383 TransitionsAfterwards, 1856 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 220 PlacesBefore, 220 PlacesAfterwards, 406 TransitionsBefore, 406 TransitionsAfterwards, 1976 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 208 PlacesBefore, 208 PlacesAfterwards, 344 TransitionsBefore, 344 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 78, Positive conditional cache size: 78, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 219 PlacesBefore, 219 PlacesAfterwards, 355 TransitionsBefore, 355 TransitionsAfterwards, 1636 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 83, Positive conditional cache size: 83, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 222 PlacesBefore, 221 PlacesAfterwards, 391 TransitionsBefore, 390 TransitionsAfterwards, 1696 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, 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): 96, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 221 PlacesBefore, 221 PlacesAfterwards, 387 TransitionsBefore, 387 TransitionsAfterwards, 1688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 222 PlacesBefore, 222 PlacesAfterwards, 388 TransitionsBefore, 388 TransitionsAfterwards, 1700 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, 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): 97, Positive cache size: 87, Positive conditional cache size: 87, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 229 PlacesBefore, 229 PlacesAfterwards, 385 TransitionsBefore, 385 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 233 PlacesBefore, 233 PlacesAfterwards, 404 TransitionsBefore, 404 TransitionsAfterwards, 1752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 239 PlacesBefore, 239 PlacesAfterwards, 434 TransitionsBefore, 434 TransitionsAfterwards, 1974 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 250 PlacesBefore, 249 PlacesAfterwards, 458 TransitionsBefore, 457 TransitionsAfterwards, 2066 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 261 PlacesBefore, 259 PlacesAfterwards, 469 TransitionsBefore, 467 TransitionsAfterwards, 2130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 255 PlacesBefore, 255 PlacesAfterwards, 475 TransitionsBefore, 475 TransitionsAfterwards, 2142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 256 PlacesBefore, 256 PlacesAfterwards, 482 TransitionsBefore, 482 TransitionsAfterwards, 2164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 275 PlacesBefore, 275 PlacesAfterwards, 516 TransitionsBefore, 516 TransitionsAfterwards, 2344 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 281 PlacesBefore, 281 PlacesAfterwards, 518 TransitionsBefore, 518 TransitionsAfterwards, 2336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 293 PlacesBefore, 293 PlacesAfterwards, 535 TransitionsBefore, 535 TransitionsAfterwards, 2502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 305 PlacesBefore, 305 PlacesAfterwards, 547 TransitionsBefore, 547 TransitionsAfterwards, 2508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 313 PlacesBefore, 313 PlacesAfterwards, 565 TransitionsBefore, 565 TransitionsAfterwards, 2648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 318 PlacesBefore, 317 PlacesAfterwards, 586 TransitionsBefore, 585 TransitionsAfterwards, 2722 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 127, Positive conditional cache size: 127, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 324 PlacesBefore, 324 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 127, Positive conditional cache size: 127, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 325 PlacesBefore, 325 PlacesAfterwards, 591 TransitionsBefore, 591 TransitionsAfterwards, 2778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 135, Positive conditional cache size: 135, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 334 PlacesBefore, 332 PlacesAfterwards, 611 TransitionsBefore, 608 TransitionsAfterwards, 2808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, 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): 148, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 329 PlacesBefore, 329 PlacesAfterwards, 606 TransitionsBefore, 606 TransitionsAfterwards, 2798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 336 PlacesBefore, 336 PlacesAfterwards, 603 TransitionsBefore, 603 TransitionsAfterwards, 2792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 350 PlacesBefore, 350 PlacesAfterwards, 628 TransitionsBefore, 628 TransitionsAfterwards, 2864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 351 PlacesBefore, 351 PlacesAfterwards, 616 TransitionsBefore, 616 TransitionsAfterwards, 2770 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 138, Positive conditional cache size: 138, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 352 PlacesBefore, 352 PlacesAfterwards, 627 TransitionsBefore, 627 TransitionsAfterwards, 2792 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 356 PlacesBefore, 356 PlacesAfterwards, 640 TransitionsBefore, 640 TransitionsAfterwards, 2872 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 363 PlacesBefore, 363 PlacesAfterwards, 701 TransitionsBefore, 701 TransitionsAfterwards, 3052 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 367 PlacesBefore, 367 PlacesAfterwards, 693 TransitionsBefore, 693 TransitionsAfterwards, 3024 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 367 PlacesBefore, 367 PlacesAfterwards, 696 TransitionsBefore, 696 TransitionsAfterwards, 3038 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 378 PlacesBefore, 378 PlacesAfterwards, 746 TransitionsBefore, 746 TransitionsAfterwards, 3250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 399 PlacesBefore, 399 PlacesAfterwards, 788 TransitionsBefore, 788 TransitionsAfterwards, 3486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 404 PlacesBefore, 404 PlacesAfterwards, 792 TransitionsBefore, 792 TransitionsAfterwards, 3494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 409 PlacesBefore, 409 PlacesAfterwards, 805 TransitionsBefore, 805 TransitionsAfterwards, 3582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 407 PlacesBefore, 407 PlacesAfterwards, 804 TransitionsBefore, 804 TransitionsAfterwards, 3580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 412 PlacesBefore, 412 PlacesAfterwards, 804 TransitionsBefore, 804 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 144, Positive conditional cache size: 144, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 416 PlacesBefore, 416 PlacesAfterwards, 834 TransitionsBefore, 834 TransitionsAfterwards, 3686 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 146, Positive conditional cache size: 146, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 407 PlacesBefore, 406 PlacesAfterwards, 818 TransitionsBefore, 817 TransitionsAfterwards, 3686 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 418 PlacesBefore, 418 PlacesAfterwards, 836 TransitionsBefore, 836 TransitionsAfterwards, 3818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 438 PlacesBefore, 438 PlacesAfterwards, 884 TransitionsBefore, 884 TransitionsAfterwards, 4000 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 425 PlacesBefore, 425 PlacesAfterwards, 831 TransitionsBefore, 831 TransitionsAfterwards, 3766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 419 PlacesBefore, 419 PlacesAfterwards, 835 TransitionsBefore, 835 TransitionsAfterwards, 3774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 435 PlacesBefore, 435 PlacesAfterwards, 899 TransitionsBefore, 899 TransitionsAfterwards, 4060 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 147, Positive conditional cache size: 147, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 436 PlacesBefore, 436 PlacesAfterwards, 899 TransitionsBefore, 899 TransitionsAfterwards, 4060 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 436 PlacesBefore, 436 PlacesAfterwards, 898 TransitionsBefore, 898 TransitionsAfterwards, 4052 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 440 PlacesBefore, 440 PlacesAfterwards, 898 TransitionsBefore, 898 TransitionsAfterwards, 4052 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 461 PlacesBefore, 461 PlacesAfterwards, 948 TransitionsBefore, 948 TransitionsAfterwards, 4306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 472 PlacesBefore, 468 PlacesAfterwards, 985 TransitionsBefore, 981 TransitionsAfterwards, 4284 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 432 PlacesBefore, 428 PlacesAfterwards, 798 TransitionsBefore, 794 TransitionsAfterwards, 3406 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 215, Positive conditional cache size: 215, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 398 PlacesBefore, 399 PlacesAfterwards, 790 TransitionsBefore, 790 TransitionsAfterwards, 3382 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, 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): 226, Positive cache size: 216, Positive conditional cache size: 216, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 399 PlacesBefore, 396 PlacesAfterwards, 789 TransitionsBefore, 787 TransitionsAfterwards, 3380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 218, Positive conditional cache size: 218, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 379 PlacesBefore, 379 PlacesAfterwards, 694 TransitionsBefore, 694 TransitionsAfterwards, 2854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 218, Positive conditional cache size: 218, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 376 PlacesBefore, 376 PlacesAfterwards, 721 TransitionsBefore, 721 TransitionsAfterwards, 2942 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 223, Positive conditional cache size: 223, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/89 universal loopers) in iteration 102,while PetriNetUnfolder was constructing finite prefix that currently has 88068 conditions, 5546 events (3246/5545 cut-off events. For 878185/878185 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 44645 event pairs, 932 based on Foata normal form. 130/6456 useless extension candidates. Maximal degree in co-relation 86215. Up to 1798 conditions per place.). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/89 universal loopers) in iteration 102,while PetriNetUnfolder was constructing finite prefix that currently has 88068 conditions, 5546 events (3246/5545 cut-off events. For 878185/878185 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 44645 event pairs, 932 based on Foata normal form. 130/6456 useless extension candidates. Maximal degree in co-relation 86215. Up to 1798 conditions per place.). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/89 universal loopers) in iteration 102,while PetriNetUnfolder was constructing finite prefix that currently has 88068 conditions, 5546 events (3246/5545 cut-off events. For 878185/878185 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 44645 event pairs, 932 based on Foata normal form. 130/6456 useless extension candidates. Maximal degree in co-relation 86215. Up to 1798 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 175 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 800.1s, OverallIterations: 102, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 601.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 95 mSolverCounterUnknown, 5364 SdHoareTripleChecker+Valid, 34.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5364 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 29.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 202 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2860 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61348 IncrementalHoareTripleChecker+Invalid, 64505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2860 mSolverCounterUnsat, 0 mSDtfsCounter, 61348 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2571 GetRequests, 1411 SyntacticMatches, 41 SemanticMatches, 1119 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1922 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33013occurred in iteration=96, InterpolantAutomatonStates: 904, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 50.3s InterpolantComputationTime, 2464 NumberOfCodeBlocks, 2464 NumberOfCodeBlocksAsserted, 199 NumberOfCheckSat, 3091 ConstructedInterpolants, 105 QuantifiedInterpolants, 44168 SizeOfPredicates, 929 NumberOfNonLiveVariables, 17751 ConjunctsInSsa, 1711 ConjunctsInUnsatCore, 250 InterpolantComputations, 38 PerfectInterpolantSequences, 274/626 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown