/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/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:46:49,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:46:49,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:46:49,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:46:49,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:46:49,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:46:49,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:46:49,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:46:49,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:46:49,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:46:49,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:46:49,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:46:49,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:46:49,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:46:49,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:46:49,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:46:49,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:46:49,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:46:49,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:46:49,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:46:49,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:46:49,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:46:49,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:46:49,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:46:49,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:46:49,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:46:49,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:46:49,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:46:49,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:46:49,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:46:49,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:46:49,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:46:49,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:46:49,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:46:49,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:46:49,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:46:49,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:46:49,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:46:49,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:46:49,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:46:49,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:46:49,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:46:49,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:46:49,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:46:49,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:46:49,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:46:49,727 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:46:49,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:46:49,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:46:49,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:46:49,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:46:49,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:46:49,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:46:49,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:46:49,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:46:49,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:46:50,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:46:50,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:46:50,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:46:50,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:46:50,038 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:46:50,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2022-12-06 05:46:51,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:46:51,273 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:46:51,274 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2022-12-06 05:46:51,297 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b32546b/21195877280b4660b0bce3a6f7d7278c/FLAGeb4b84de0 [2022-12-06 05:46:51,309 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b32546b/21195877280b4660b0bce3a6f7d7278c [2022-12-06 05:46:51,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:46:51,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:46:51,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:46:51,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:46:51,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:46:51,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454e8ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51, skipping insertion in model container [2022-12-06 05:46:51,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:46:51,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:46:51,493 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/unroll-cond-4.wvr.c[2808,2821] [2022-12-06 05:46:51,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:46:51,508 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:46:51,540 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/unroll-cond-4.wvr.c[2808,2821] [2022-12-06 05:46:51,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:46:51,553 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:46:51,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51 WrapperNode [2022-12-06 05:46:51,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:46:51,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:46:51,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:46:51,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:46:51,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,600 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 183 [2022-12-06 05:46:51,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:46:51,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:46:51,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:46:51,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:46:51,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,627 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:46:51,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:46:51,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:46:51,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:46:51,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (1/1) ... [2022-12-06 05:46:51,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:46:51,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:51,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:46:51,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:46:51,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:46:51,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:46:51,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:46:51,724 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:46:51,825 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:46:51,827 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:46:52,120 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:46:52,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:46:52,127 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:46:52,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:46:52 BoogieIcfgContainer [2022-12-06 05:46:52,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:46:52,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:46:52,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:46:52,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:46:52,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:46:51" (1/3) ... [2022-12-06 05:46:52,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdc6d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:46:52, skipping insertion in model container [2022-12-06 05:46:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:51" (2/3) ... [2022-12-06 05:46:52,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdc6d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:46:52, skipping insertion in model container [2022-12-06 05:46:52,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:46:52" (3/3) ... [2022-12-06 05:46:52,135 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2022-12-06 05:46:52,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:46:52,148 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:46:52,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:46:52,245 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:46:52,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 219 transitions, 454 flow [2022-12-06 05:46:52,375 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-06 05:46:52,376 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 381 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2022-12-06 05:46:52,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 219 transitions, 454 flow [2022-12-06 05:46:52,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 209 transitions, 430 flow [2022-12-06 05:46:52,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:52,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 209 transitions, 430 flow [2022-12-06 05:46:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 209 transitions, 430 flow [2022-12-06 05:46:52,441 INFO L130 PetriNetUnfolder]: 21/209 cut-off events. [2022-12-06 05:46:52,441 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:52,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 209 events. 21/209 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 362 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2022-12-06 05:46:52,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 209 transitions, 430 flow [2022-12-06 05:46:52,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 5492 [2022-12-06 05:47:00,082 INFO L203 LiptonReduction]: Total number of compositions: 189 [2022-12-06 05:47:00,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:47:00,119 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;@28fb8ffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:47:00,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:47:00,126 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:47:00,126 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:47:00,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:00,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:00,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 31865598, now seen corresponding path program 1 times [2022-12-06 05:47:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:00,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200166853] [2022-12-06 05:47:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:00,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200166853] [2022-12-06 05:47:00,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200166853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:00,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:00,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:47:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066073015] [2022-12-06 05:47:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:00,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:00,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:00,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:47:00,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:00,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:00,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:47:00,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:00,559 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-06 05:47:00,559 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:47:00,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 19 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-06 05:47:00,561 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:47:00,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:47:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:47:00,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:47:00,571 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 05:47:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:47:00,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:47:00,574 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:47:00,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 05:47:00,578 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:47:00,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:00,579 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:47:00,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:00,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:00,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:47:00,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:47:00,589 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:47:00,589 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:47:00,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 05:47:00,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:47:00,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:47:01,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:01,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-06 05:47:01,311 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:47:01,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:01,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:01,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:47:01,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash -733193231, now seen corresponding path program 1 times [2022-12-06 05:47:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:01,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296607559] [2022-12-06 05:47:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:01,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296607559] [2022-12-06 05:47:01,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296607559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:01,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:01,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:47:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122057697] [2022-12-06 05:47:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:01,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:47:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:47:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:47:01,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:47:01,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:01,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:01,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:47:01,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:01,747 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-06 05:47:01,747 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:47:01,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 367 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-06 05:47:01,750 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-06 05:47:01,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-06 05:47:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:47:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:47:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:47:01,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 05:47:01,751 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:47:01,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-06 05:47:01,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:01,753 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-06 05:47:01,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 05:47:01,753 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:47:01,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:01,754 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 05:47:01,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:01,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:01,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 05:47:01,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 05:47:01,759 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 05:47:01,759 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-06 05:47:01,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 05:47:01,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 05:47:01,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:47:02,012 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:02,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-06 05:47:02,013 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 65 flow [2022-12-06 05:47:02,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:02,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:02,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:47:02,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2018495377, now seen corresponding path program 1 times [2022-12-06 05:47:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:02,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578957874] [2022-12-06 05:47:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:02,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578957874] [2022-12-06 05:47:02,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578957874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:02,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:02,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901764591] [2022-12-06 05:47:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:02,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:02,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:02,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:02,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:47:02,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:02,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:47:02,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:02,324 INFO L130 PetriNetUnfolder]: 88/166 cut-off events. [2022-12-06 05:47:02,325 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 05:47:02,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 166 events. 88/166 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 479 event pairs, 33 based on Foata normal form. 2/131 useless extension candidates. Maximal degree in co-relation 210. Up to 113 conditions per place. [2022-12-06 05:47:02,326 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-06 05:47:02,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 36 transitions, 199 flow [2022-12-06 05:47:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:47:02,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 05:47:02,330 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 65 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:47:02,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 36 transitions, 199 flow [2022-12-06 05:47:02,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 36 transitions, 159 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:02,332 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 68 flow [2022-12-06 05:47:02,332 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 05:47:02,333 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:47:02,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:02,333 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 68 flow [2022-12-06 05:47:02,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:02,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:02,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 68 flow [2022-12-06 05:47:02,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 68 flow [2022-12-06 05:47:02,341 INFO L130 PetriNetUnfolder]: 5/36 cut-off events. [2022-12-06 05:47:02,341 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:47:02,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 36 events. 5/36 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 8 conditions per place. [2022-12-06 05:47:02,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 68 flow [2022-12-06 05:47:02,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 05:47:02,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:02,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 05:47:02,440 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 71 flow [2022-12-06 05:47:02,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:02,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:02,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:47:02,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 122072211, now seen corresponding path program 1 times [2022-12-06 05:47:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:02,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288458287] [2022-12-06 05:47:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288458287] [2022-12-06 05:47:02,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288458287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:02,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:02,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132592870] [2022-12-06 05:47:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:02,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:47:02,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:02,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:47:02,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:02,679 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 05:47:02,679 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-06 05:47:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 169 events. 87/169 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 542 event pairs, 44 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 248. Up to 116 conditions per place. [2022-12-06 05:47:02,680 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 05:47:02,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 35 transitions, 183 flow [2022-12-06 05:47:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 05:47:02,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-06 05:47:02,681 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 71 flow. Second operand 4 states and 34 transitions. [2022-12-06 05:47:02,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 35 transitions, 183 flow [2022-12-06 05:47:02,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 35 transitions, 178 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:02,682 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 82 flow [2022-12-06 05:47:02,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2022-12-06 05:47:02,683 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 05:47:02,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:02,683 INFO L89 Accepts]: Start accepts. Operand has 27 places, 22 transitions, 82 flow [2022-12-06 05:47:02,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:02,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:02,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 82 flow [2022-12-06 05:47:02,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 82 flow [2022-12-06 05:47:02,688 INFO L130 PetriNetUnfolder]: 4/37 cut-off events. [2022-12-06 05:47:02,688 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 05:47:02,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 37 events. 4/37 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 89 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 47. Up to 6 conditions per place. [2022-12-06 05:47:02,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 82 flow [2022-12-06 05:47:02,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 05:47:02,697 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:02,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:47:02,698 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 75 flow [2022-12-06 05:47:02,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:02,698 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:02,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:47:02,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash 339979274, now seen corresponding path program 1 times [2022-12-06 05:47:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359043291] [2022-12-06 05:47:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359043291] [2022-12-06 05:47:02,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359043291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:02,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:02,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735334872] [2022-12-06 05:47:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:02,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:02,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:47:02,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:02,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:47:02,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:03,058 INFO L130 PetriNetUnfolder]: 113/223 cut-off events. [2022-12-06 05:47:03,059 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-06 05:47:03,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 223 events. 113/223 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 800 event pairs, 55 based on Foata normal form. 2/184 useless extension candidates. Maximal degree in co-relation 418. Up to 163 conditions per place. [2022-12-06 05:47:03,060 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 3 changer transitions 1/38 dead transitions. [2022-12-06 05:47:03,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 202 flow [2022-12-06 05:47:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 05:47:03,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 05:47:03,061 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 75 flow. Second operand 4 states and 38 transitions. [2022-12-06 05:47:03,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 202 flow [2022-12-06 05:47:03,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 196 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:03,063 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 94 flow [2022-12-06 05:47:03,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 05:47:03,065 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-06 05:47:03,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:03,066 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 94 flow [2022-12-06 05:47:03,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:03,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:03,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 94 flow [2022-12-06 05:47:03,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 94 flow [2022-12-06 05:47:03,072 INFO L130 PetriNetUnfolder]: 3/42 cut-off events. [2022-12-06 05:47:03,072 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 05:47:03,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 42 events. 3/42 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 117 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 50. Up to 8 conditions per place. [2022-12-06 05:47:03,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 94 flow [2022-12-06 05:47:03,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 05:47:03,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:03,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 05:47:03,427 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 97 flow [2022-12-06 05:47:03,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:03,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:03,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:03,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:47:03,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1879967227, now seen corresponding path program 2 times [2022-12-06 05:47:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:03,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483667723] [2022-12-06 05:47:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:03,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483667723] [2022-12-06 05:47:03,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483667723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:03,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:03,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334499784] [2022-12-06 05:47:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:03,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:03,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:03,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:03,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:47:03,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:03,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:03,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:47:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:03,696 INFO L130 PetriNetUnfolder]: 103/203 cut-off events. [2022-12-06 05:47:03,697 INFO L131 PetriNetUnfolder]: For 365/365 co-relation queries the response was YES. [2022-12-06 05:47:03,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 203 events. 103/203 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 699 event pairs, 64 based on Foata normal form. 4/178 useless extension candidates. Maximal degree in co-relation 424. Up to 180 conditions per place. [2022-12-06 05:47:03,699 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 26 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 05:47:03,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 189 flow [2022-12-06 05:47:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 05:47:03,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:47:03,701 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 97 flow. Second operand 4 states and 32 transitions. [2022-12-06 05:47:03,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 189 flow [2022-12-06 05:47:03,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 172 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:03,704 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 88 flow [2022-12-06 05:47:03,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-06 05:47:03,706 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-06 05:47:03,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:03,706 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 88 flow [2022-12-06 05:47:03,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:03,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:03,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 88 flow [2022-12-06 05:47:03,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 88 flow [2022-12-06 05:47:03,713 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 05:47:03,713 INFO L131 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2022-12-06 05:47:03,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 39 events. 3/39 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 60. Up to 5 conditions per place. [2022-12-06 05:47:03,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 88 flow [2022-12-06 05:47:03,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 05:47:04,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:04,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 439 [2022-12-06 05:47:04,145 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 82 flow [2022-12-06 05:47:04,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:04,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:04,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:04,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:47:04,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1196254838, now seen corresponding path program 1 times [2022-12-06 05:47:04,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:04,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465187083] [2022-12-06 05:47:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:04,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465187083] [2022-12-06 05:47:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465187083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:04,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723804782] [2022-12-06 05:47:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:04,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:04,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:47:04,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:04,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:04,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:47:04,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:04,409 INFO L130 PetriNetUnfolder]: 119/235 cut-off events. [2022-12-06 05:47:04,409 INFO L131 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2022-12-06 05:47:04,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 235 events. 119/235 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 859 event pairs, 64 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 625. Up to 184 conditions per place. [2022-12-06 05:47:04,411 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 34 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-06 05:47:04,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 216 flow [2022-12-06 05:47:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 05:47:04,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 05:47:04,412 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 82 flow. Second operand 4 states and 38 transitions. [2022-12-06 05:47:04,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 216 flow [2022-12-06 05:47:04,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 196 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:04,413 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 105 flow [2022-12-06 05:47:04,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 05:47:04,413 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-06 05:47:04,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:04,413 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 105 flow [2022-12-06 05:47:04,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:04,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:04,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 105 flow [2022-12-06 05:47:04,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 105 flow [2022-12-06 05:47:04,420 INFO L130 PetriNetUnfolder]: 5/51 cut-off events. [2022-12-06 05:47:04,420 INFO L131 PetriNetUnfolder]: For 42/44 co-relation queries the response was YES. [2022-12-06 05:47:04,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 51 events. 5/51 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 167 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 68. Up to 10 conditions per place. [2022-12-06 05:47:04,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 105 flow [2022-12-06 05:47:04,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 05:47:05,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [903] $Ultimate##0-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_47| 4294967296) (mod v_~n~0_113 4294967296))) (= |v_thread1Thread1of1ForFork1_#res#1.base_11| 0) (= |v_thread1Thread1of1ForFork1_~i~0#1_47| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_11| 0)) InVars {~n~0=v_~n~0_113} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_11|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_11|, ~n~0=v_~n~0_113} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [899] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_181| v_~f~0.base_141))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_141 (* v_~x2~0_285 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_141 (* .cse2 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_141 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_252| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_167)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_262| 4294967296) (mod (+ v_~n~0_105 4294967293) 4294967296)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_252| 0)) (not (= (ite (and (< .cse1 v_~size~0_167) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_167) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_285) (< v_~x2~0_285 v_~size~0_167)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_141 (* .cse0 4))) v_~x2~0_283) (= |v_thread2Thread1of1ForFork0_~i~1#1_260| (+ |v_thread2Thread1of1ForFork0_~i~1#1_262| 4))))))) InVars {~x2~0=v_~x2~0_285, ~size~0=v_~size~0_167, ~f~0.base=v_~f~0.base_141, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_262|, ~n~0=v_~n~0_105, ~f~0.offset=v_~f~0.offset_141} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_31|, ~x2~0=v_~x2~0_283, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_29|, ~size~0=v_~size~0_167, ~f~0.base=v_~f~0.base_141, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_260|, ~f~0.offset=v_~f~0.offset_141, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_27|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_252|, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_31|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_33|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_31|, ~n~0=v_~n~0_105, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_37|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:47:05,219 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:05,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 807 [2022-12-06 05:47:05,220 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 118 flow [2022-12-06 05:47:05,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:05,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:05,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:05,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:47:05,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 681281710, now seen corresponding path program 2 times [2022-12-06 05:47:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:05,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995056579] [2022-12-06 05:47:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995056579] [2022-12-06 05:47:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995056579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509084555] [2022-12-06 05:47:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:05,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:05,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:47:05,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:05,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:05,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:47:05,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:05,484 INFO L130 PetriNetUnfolder]: 114/224 cut-off events. [2022-12-06 05:47:05,484 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-12-06 05:47:05,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 224 events. 114/224 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 798 event pairs, 71 based on Foata normal form. 4/209 useless extension candidates. Maximal degree in co-relation 471. Up to 201 conditions per place. [2022-12-06 05:47:05,485 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 28 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2022-12-06 05:47:05,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 216 flow [2022-12-06 05:47:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 05:47:05,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-06 05:47:05,486 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 118 flow. Second operand 4 states and 34 transitions. [2022-12-06 05:47:05,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 216 flow [2022-12-06 05:47:05,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 204 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 05:47:05,488 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 114 flow [2022-12-06 05:47:05,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-06 05:47:05,488 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-06 05:47:05,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:05,488 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 114 flow [2022-12-06 05:47:05,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:05,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:05,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 114 flow [2022-12-06 05:47:05,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 114 flow [2022-12-06 05:47:05,494 INFO L130 PetriNetUnfolder]: 4/45 cut-off events. [2022-12-06 05:47:05,494 INFO L131 PetriNetUnfolder]: For 37/41 co-relation queries the response was YES. [2022-12-06 05:47:05,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 45 events. 4/45 cut-off events. For 37/41 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 77. Up to 7 conditions per place. [2022-12-06 05:47:05,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 114 flow [2022-12-06 05:47:05,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 05:47:07,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [906] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_193| v_~f~0.base_151))) (let ((.cse4 (select .cse7 (+ v_~f~0.offset_151 (* v_~x2~0_311 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_151 (* .cse4 4))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_151 (* .cse5 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_151 (* .cse0 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_151 (* .cse6 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_151 (* .cse3 4))))) (let ((.cse1 (select .cse7 (+ (* 4 .cse2) v_~f~0.offset_151)))) (and (not (= (ite (and (< .cse0 v_~size~0_177) (<= 0 .cse0)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_270| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_177)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|) (< 4 (mod (+ v_~n~0_117 4294967293) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_177) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_177)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_284| 8) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_270| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|) (not (= (ite (and (< .cse4 v_~size~0_177) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_311 v_~size~0_177) (<= 0 v_~x2~0_311)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_177) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_177) (<= 0 .cse6)) 1 0) 0)) (= v_~x2~0_309 (select .cse7 (+ v_~f~0.offset_151 (* .cse1 4))))))))))))) InVars {~x2~0=v_~x2~0_311, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_151, #memory_int=|v_#memory_int_193|, ~n~0=v_~n~0_117, ~f~0.offset=v_~f~0.offset_151} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_37|, ~x2~0=v_~x2~0_309, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_35|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_151, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_284|, ~f~0.offset=v_~f~0.offset_151, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_33|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|, #memory_int=|v_#memory_int_193|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_37|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_41|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_37|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_43|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] and [910] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_199| v_~f~0.base_157))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_157 (* v_~x2~0_336 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_157 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_157 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork1_~i~0#1_49| 0) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_307| 4) |v_thread2Thread1of1ForFork0_~i~1#1_306|) (= |v_thread1Thread1of1ForFork1_#res#1.base_13| 0) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_183)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_228|) (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_49| 4294967296) (mod v_~n~0_123 4294967296))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_13| 0) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_307| 4294967296) (mod (+ v_~n~0_123 4294967293) 4294967296)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_292| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_228|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_292| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_183)) 1 0) 0)) (= v_~x2~0_335 (select .cse2 (+ v_~f~0.offset_157 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_183)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_336 v_~size~0_183) (<= 0 v_~x2~0_336)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_336, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_157, #memory_int=|v_#memory_int_199|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_307|, ~n~0=v_~n~0_123, ~f~0.offset=v_~f~0.offset_157} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_45|, ~x2~0=v_~x2~0_335, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_43|, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_157, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_228|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_306|, ~f~0.offset=v_~f~0.offset_157, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_41|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_292|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_49|, #memory_int=|v_#memory_int_199|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_45|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_13|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_49|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_45|, ~n~0=v_~n~0_123, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_51|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:47:08,107 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:08,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2620 [2022-12-06 05:47:08,108 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 109 flow [2022-12-06 05:47:08,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:08,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:08,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:08,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:47:08,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 823832819, now seen corresponding path program 1 times [2022-12-06 05:47:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:08,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933422294] [2022-12-06 05:47:08,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:08,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933422294] [2022-12-06 05:47:08,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933422294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:08,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:08,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135322211] [2022-12-06 05:47:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:08,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:47:08,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:08,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:08,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:47:08,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:08,512 INFO L130 PetriNetUnfolder]: 130/256 cut-off events. [2022-12-06 05:47:08,512 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2022-12-06 05:47:08,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 256 events. 130/256 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 954 event pairs, 69 based on Foata normal form. 4/239 useless extension candidates. Maximal degree in co-relation 711. Up to 203 conditions per place. [2022-12-06 05:47:08,514 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 35 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2022-12-06 05:47:08,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 249 flow [2022-12-06 05:47:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 05:47:08,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 05:47:08,515 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 109 flow. Second operand 4 states and 40 transitions. [2022-12-06 05:47:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 249 flow [2022-12-06 05:47:08,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 223 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:08,518 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 131 flow [2022-12-06 05:47:08,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 05:47:08,519 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-06 05:47:08,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:08,519 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 131 flow [2022-12-06 05:47:08,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:08,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:08,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 131 flow [2022-12-06 05:47:08,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 131 flow [2022-12-06 05:47:08,554 INFO L130 PetriNetUnfolder]: 6/57 cut-off events. [2022-12-06 05:47:08,554 INFO L131 PetriNetUnfolder]: For 69/75 co-relation queries the response was YES. [2022-12-06 05:47:08,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 57 events. 6/57 cut-off events. For 69/75 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 212 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 81. Up to 9 conditions per place. [2022-12-06 05:47:08,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 131 flow [2022-12-06 05:47:08,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 05:47:09,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [903] $Ultimate##0-->thread1EXIT: Formula: (and (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_47| 4294967296) (mod v_~n~0_113 4294967296))) (= |v_thread1Thread1of1ForFork1_#res#1.base_11| 0) (= |v_thread1Thread1of1ForFork1_~i~0#1_47| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_11| 0)) InVars {~n~0=v_~n~0_113} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_47|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_11|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_11|, ~n~0=v_~n~0_113} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] and [899] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_181| v_~f~0.base_141))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_141 (* v_~x2~0_285 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_141 (* .cse2 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_141 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_252| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_167)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_262| 4294967296) (mod (+ v_~n~0_105 4294967293) 4294967296)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_252| 0)) (not (= (ite (and (< .cse1 v_~size~0_167) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_167) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_285) (< v_~x2~0_285 v_~size~0_167)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_141 (* .cse0 4))) v_~x2~0_283) (= |v_thread2Thread1of1ForFork0_~i~1#1_260| (+ |v_thread2Thread1of1ForFork0_~i~1#1_262| 4))))))) InVars {~x2~0=v_~x2~0_285, ~size~0=v_~size~0_167, ~f~0.base=v_~f~0.base_141, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_262|, ~n~0=v_~n~0_105, ~f~0.offset=v_~f~0.offset_141} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_31|, ~x2~0=v_~x2~0_283, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_29|, ~size~0=v_~size~0_167, ~f~0.base=v_~f~0.base_141, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_260|, ~f~0.offset=v_~f~0.offset_141, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_27|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_252|, #memory_int=|v_#memory_int_181|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_31|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_33|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_31|, ~n~0=v_~n~0_105, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_37|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:47:10,972 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:10,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2453 [2022-12-06 05:47:10,972 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 151 flow [2022-12-06 05:47:10,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:10,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:10,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:10,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:47:10,973 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash -993885729, now seen corresponding path program 1 times [2022-12-06 05:47:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:10,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102803575] [2022-12-06 05:47:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:11,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:11,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102803575] [2022-12-06 05:47:11,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102803575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:11,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:11,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385740093] [2022-12-06 05:47:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:11,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:11,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:47:11,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:11,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:11,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:47:11,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:11,195 INFO L130 PetriNetUnfolder]: 196/390 cut-off events. [2022-12-06 05:47:11,195 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2022-12-06 05:47:11,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 390 events. 196/390 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1766 event pairs, 89 based on Foata normal form. 8/357 useless extension candidates. Maximal degree in co-relation 978. Up to 255 conditions per place. [2022-12-06 05:47:11,197 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-06 05:47:11,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 371 flow [2022-12-06 05:47:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 05:47:11,198 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 05:47:11,198 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 151 flow. Second operand 4 states and 50 transitions. [2022-12-06 05:47:11,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 371 flow [2022-12-06 05:47:11,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 339 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-12-06 05:47:11,200 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 149 flow [2022-12-06 05:47:11,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-06 05:47:11,201 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 05:47:11,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:11,201 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 149 flow [2022-12-06 05:47:11,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:11,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:11,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 149 flow [2022-12-06 05:47:11,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 149 flow [2022-12-06 05:47:11,225 INFO L130 PetriNetUnfolder]: 6/79 cut-off events. [2022-12-06 05:47:11,226 INFO L131 PetriNetUnfolder]: For 52/62 co-relation queries the response was YES. [2022-12-06 05:47:11,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 79 events. 6/79 cut-off events. For 52/62 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 376 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 121. Up to 13 conditions per place. [2022-12-06 05:47:11,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 149 flow [2022-12-06 05:47:11,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 05:47:11,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [909] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_197| v_~f~0.base_155))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_155 (* v_~x2~0_331 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_155 (* .cse2 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_155 (* .cse8 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_155 (* .cse10 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_155 (* .cse11 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_155 (* .cse6 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_155 (* .cse9 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_155 (* 4 .cse4))))) (let ((.cse5 (select .cse0 (+ (* .cse7 4) v_~f~0.offset_155)))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_155 (* .cse5 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_155 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_288| 0)) (= (select .cse0 (+ v_~f~0.offset_155 (* 4 .cse1))) v_~x2~0_329) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_181)) 1 0) 0)) (< 8 (mod (+ v_~n~0_121 4294967293) 4294967296)) (not (= (ite (and (< .cse5 v_~size~0_181) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_181) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_~i~1#1_302| 12) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_181)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_288| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_224|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_224| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_181)) 1 0)) (not (= (ite (and (< .cse10 v_~size~0_181) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_331) (< v_~x2~0_331 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_181) (<= 0 .cse11)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_331, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_155, #memory_int=|v_#memory_int_197|, ~n~0=v_~n~0_121, ~f~0.offset=v_~f~0.offset_155} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_41|, ~x2~0=v_~x2~0_329, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_39|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_155, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_224|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_302|, ~f~0.offset=v_~f~0.offset_155, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_37|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_288|, #memory_int=|v_#memory_int_197|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_41|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_45|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_41|, ~n~0=v_~n~0_121, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_47|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] and [916] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_207| v_~f~0.base_165))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_165 (* v_~x2~0_368 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_165 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_165 (* .cse3 4))))) (and (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_333| 4294967296) (mod (+ v_~n~0_131 4294967293) 4294967296)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_17| 0) (not (= (ite (and (<= 0 v_~x2~0_368) (< v_~x2~0_368 v_~size~0_191)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_316| 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_53| 0) (= (select .cse0 (+ v_~f~0.offset_165 (* .cse1 4))) v_~x2~0_367) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_316| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_252|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_333| 4) |v_thread2Thread1of1ForFork0_~i~1#1_332|) (= |v_thread1Thread1of1ForFork1_#res#1.base_17| 0) (not (= 0 (ite (and (< .cse2 v_~size~0_191) (<= 0 .cse2)) 1 0))) (not (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_53| 4294967296) (mod v_~n~0_131 4294967296))) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_252| (ite (and (< .cse1 v_~size~0_191) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_191) (<= 0 .cse3)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_368, ~size~0=v_~size~0_191, ~f~0.base=v_~f~0.base_165, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_333|, ~n~0=v_~n~0_131, ~f~0.offset=v_~f~0.offset_165} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_57|, ~x2~0=v_~x2~0_367, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_55|, ~size~0=v_~size~0_191, ~f~0.base=v_~f~0.base_165, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_252|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_332|, ~f~0.offset=v_~f~0.offset_165, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_53|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_316|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_53|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_57|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_61|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_57|, ~n~0=v_~n~0_131, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_17|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_63|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_65|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread2Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] [2022-12-06 05:47:12,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:12,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1200 [2022-12-06 05:47:12,401 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 152 flow [2022-12-06 05:47:12,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:12,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:12,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:12,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:47:12,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -420393915, now seen corresponding path program 1 times [2022-12-06 05:47:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238219732] [2022-12-06 05:47:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238219732] [2022-12-06 05:47:12,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238219732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:12,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:12,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284081775] [2022-12-06 05:47:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:12,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:12,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:47:12,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:12,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:12,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:47:12,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:12,750 INFO L130 PetriNetUnfolder]: 199/397 cut-off events. [2022-12-06 05:47:12,751 INFO L131 PetriNetUnfolder]: For 870/870 co-relation queries the response was YES. [2022-12-06 05:47:12,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 397 events. 199/397 cut-off events. For 870/870 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1736 event pairs, 153 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 1106. Up to 391 conditions per place. [2022-12-06 05:47:12,752 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 05:47:12,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 229 flow [2022-12-06 05:47:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 05:47:12,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-06 05:47:12,753 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 152 flow. Second operand 3 states and 29 transitions. [2022-12-06 05:47:12,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 229 flow [2022-12-06 05:47:12,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 221 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:12,755 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 163 flow [2022-12-06 05:47:12,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-06 05:47:12,756 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 05:47:12,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:12,756 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 163 flow [2022-12-06 05:47:12,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:12,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:12,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 163 flow [2022-12-06 05:47:12,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 163 flow [2022-12-06 05:47:12,763 INFO L130 PetriNetUnfolder]: 5/80 cut-off events. [2022-12-06 05:47:12,763 INFO L131 PetriNetUnfolder]: For 79/89 co-relation queries the response was YES. [2022-12-06 05:47:12,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 80 events. 5/80 cut-off events. For 79/89 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 389 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 134. Up to 13 conditions per place. [2022-12-06 05:47:12,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 163 flow [2022-12-06 05:47:12,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 05:47:15,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:15,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3228 [2022-12-06 05:47:15,984 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 164 flow [2022-12-06 05:47:15,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:15,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:15,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:15,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:47:15,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1468942111, now seen corresponding path program 2 times [2022-12-06 05:47:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:15,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471620580] [2022-12-06 05:47:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:16,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471620580] [2022-12-06 05:47:16,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471620580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:16,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:16,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838008081] [2022-12-06 05:47:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:16,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:16,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:47:16,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:16,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:16,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:47:16,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:16,256 INFO L130 PetriNetUnfolder]: 198/396 cut-off events. [2022-12-06 05:47:16,256 INFO L131 PetriNetUnfolder]: For 999/999 co-relation queries the response was YES. [2022-12-06 05:47:16,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 396 events. 198/396 cut-off events. For 999/999 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1826 event pairs, 89 based on Foata normal form. 4/379 useless extension candidates. Maximal degree in co-relation 1263. Up to 259 conditions per place. [2022-12-06 05:47:16,258 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2022-12-06 05:47:16,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 329 flow [2022-12-06 05:47:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 05:47:16,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-06 05:47:16,259 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 164 flow. Second operand 4 states and 43 transitions. [2022-12-06 05:47:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 329 flow [2022-12-06 05:47:16,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 305 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:16,262 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 185 flow [2022-12-06 05:47:16,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-06 05:47:16,262 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 05:47:16,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:16,262 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 185 flow [2022-12-06 05:47:16,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:16,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:16,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 185 flow [2022-12-06 05:47:16,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 185 flow [2022-12-06 05:47:16,273 INFO L130 PetriNetUnfolder]: 12/97 cut-off events. [2022-12-06 05:47:16,274 INFO L131 PetriNetUnfolder]: For 104/116 co-relation queries the response was YES. [2022-12-06 05:47:16,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 97 events. 12/97 cut-off events. For 104/116 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 484 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 175. Up to 15 conditions per place. [2022-12-06 05:47:16,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 185 flow [2022-12-06 05:47:16,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 05:47:16,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [911] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse3 (select |v_#memory_int_201| v_~f~0.base_159))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_159 (* v_~x2~0_347 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_159 (* .cse10 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_159 (* .cse9 4))))) (let ((.cse5 (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_185)) 1 0)) (.cse4 (mod (+ v_~n~0_125 4294967293) 4294967296))) (and (let ((.cse0 (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_316| 4294967296) (mod v_~n~0_125 4294967296))) (.cse1 (= |v_thread2Thread1of1ForFork0_#res#1.base_21| 0)) (.cse2 (= |v_thread2Thread1of1ForFork0_#res#1.offset_21| 0))) (or (and (not .cse0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_300| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|) (= |v_thread2Thread1of1ForFork0_~i~1#1_316| |v_thread2Thread1of1ForFork0_~i~1#1_314|) .cse1 (= v_~x2~0_345 v_~x2~0_343) (= |v_thread2Thread1of1ForFork0_#t~post16#1_34| |v_thread2Thread1of1ForFork0_#t~post16#1_33|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|) .cse2 (= |v_thread2Thread1of1ForFork0_#t~mem15#1_49| |v_thread2Thread1of1ForFork0_#t~mem15#1_50|)) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_298| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|) (= (ite (and (<= 0 v_~x2~0_345) (< v_~x2~0_345 v_~size~0_185)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|) .cse0 (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_316| 1) |v_thread2Thread1of1ForFork0_~i~1#1_314|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_298| 0)) .cse1 (= (select .cse3 (+ v_~f~0.offset_159 (* v_~x2~0_345 4))) v_~x2~0_343) .cse2))) (< 0 .cse4) (not (= (ite (and (<= 0 v_~x2~0_347) (< v_~x2~0_347 v_~size~0_185)) 1 0) 0)) (not (= .cse5 0)) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_159 (* .cse8 4)))) (.cse6 (< 4 (mod (+ 4294967294 v_~n~0_125) 4294967296)))) (or (and (= |v_thread2Thread1of1ForFork0_#t~mem11#1_44| |v_thread2Thread1of1ForFork0_#t~mem11#1_43|) (not .cse6) (= |v_thread2Thread1of1ForFork0_#t~post12#1_37| |v_thread2Thread1of1ForFork0_#t~post12#1_38|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| .cse5) (= |v_thread2Thread1of1ForFork0_~i~1#1_317| 4) (= .cse5 |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_237|) (= .cse7 v_~x2~0_346)) (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_237| (ite (and (< .cse7 v_~size~0_185) (<= 0 .cse7)) 1 0)) (= 5 |v_thread2Thread1of1ForFork0_~i~1#1_317|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| 0)) (= (select .cse3 (+ (* .cse7 4) v_~f~0.offset_159)) v_~x2~0_346) .cse6 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_237|)))) (not (= (ite (and (< .cse9 v_~size~0_185) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_185) (<= 0 .cse10)) 1 0) 0)) (<= .cse4 4) (let ((.cse11 (< (mod |v_thread2Thread1of1ForFork0_~i~1#1_317| 4294967296) (mod (+ 4294967295 v_~n~0_125) 4294967296)))) (or (and (= (select .cse3 (+ v_~f~0.offset_159 (* v_~x2~0_346 4))) v_~x2~0_345) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236| (ite (and (<= 0 v_~x2~0_346) (< v_~x2~0_346 v_~size~0_185)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_300| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_317| 1) |v_thread2Thread1of1ForFork0_~i~1#1_316|) .cse11 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_300| 0))) (and (= |v_thread2Thread1of1ForFork0_#t~mem13#1_49| |v_thread2Thread1of1ForFork0_#t~mem13#1_50|) (= |v_thread2Thread1of1ForFork0_#t~post14#1_38| |v_thread2Thread1of1ForFork0_#t~post14#1_37|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|) (= |v_thread2Thread1of1ForFork0_~i~1#1_317| |v_thread2Thread1of1ForFork0_~i~1#1_316|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_237| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|) (not .cse11) (= v_~x2~0_346 v_~x2~0_345)))))))))) InVars {thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_50|, ~x2~0=v_~x2~0_347, ~size~0=v_~size~0_185, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_38|, ~f~0.base=v_~f~0.base_159, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_44|, ~f~0.offset=v_~f~0.offset_159, thread2Thread1of1ForFork0_#t~post16#1=|v_thread2Thread1of1ForFork0_#t~post16#1_34|, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_38|, #memory_int=|v_#memory_int_201|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_50|, ~n~0=v_~n~0_125} OutVars{thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_49|, thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_47|, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_45|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_21|, ~f~0.base=v_~f~0.base_159, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_234|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_314|, ~f~0.offset=v_~f~0.offset_159, thread2Thread1of1ForFork0_#t~post16#1=|v_thread2Thread1of1ForFork0_#t~post16#1_33|, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_43|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_49|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_47|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_53|, ~x2~0=v_~x2~0_343, ~size~0=v_~size~0_185, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_37|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_43|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_21|, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_37|, #memory_int=|v_#memory_int_201|, ~n~0=v_~n~0_125, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_51|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_47|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_55|} AuxVars[|v_thread2Thread1of1ForFork0_~i~1#1_317|, |v_thread2Thread1of1ForFork0_~i~1#1_316|, v_~x2~0_346, v_~x2~0_345, |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_237|, |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|, |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|, |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_300|] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, thread2Thread1of1ForFork0_#t~mem3#1, ~x2~0, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~mem11#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post16#1, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork0_#t~mem15#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork0_#t~post8#1] and [882] L49-2-->L49-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_8|) (= v_~x1~0_Out_12 (select (select |v_#memory_int_In_39| v_~f~0.base_In_27) (+ v_~f~0.offset_In_27 (* v_~x1~0_In_7 4)))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_7 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_20) (<= 0 v_~x1~0_In_7)) 1 0))) InVars {~size~0=v_~size~0_In_20, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|, ~f~0.base=v_~f~0.base_In_27, #memory_int=|v_#memory_int_In_39|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_27} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_20, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_27, #memory_int=|v_#memory_int_In_39|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_14|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_12, ~f~0.offset=v_~f~0.offset_In_27, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:18,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [907] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_195| v_~f~0.base_153))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_153 (* v_~x2~0_320 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_153 (* .cse0 4))))) (and (<= (mod (+ v_~n~0_119 4294967293) 4294967296) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_278| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|) (not (= (ite (and (< .cse0 v_~size~0_179) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_179)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|) (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0) (= 3 |v_thread2Thread1of1ForFork0_~i~1#1_292|) (not (= (ite (and (<= 0 v_~x2~0_320) (< v_~x2~0_320 v_~size~0_179)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_278| 0)) (= v_~x2~0_319 (select .cse2 (+ v_~f~0.offset_153 (* .cse1 4)))) (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_179, ~f~0.base=v_~f~0.base_153, ~f~0.offset=v_~f~0.offset_153, #memory_int=|v_#memory_int_195|, ~n~0=v_~n~0_119} OutVars{thread2Thread1of1ForFork0_#t~mem13#1=|v_thread2Thread1of1ForFork0_#t~mem13#1_45|, ~x2~0=v_~x2~0_319, ~size~0=v_~size~0_179, thread2Thread1of1ForFork0_#t~post12#1=|v_thread2Thread1of1ForFork0_#t~post12#1_33|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, ~f~0.base=v_~f~0.base_153, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_39|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_214|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_292|, ~f~0.offset=v_~f~0.offset_153, thread2Thread1of1ForFork0_#t~post16#1=|v_thread2Thread1of1ForFork0_#t~post16#1_29|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_278|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, thread2Thread1of1ForFork0_#t~post14#1=|v_thread2Thread1of1ForFork0_#t~post14#1_33|, #memory_int=|v_#memory_int_195|, thread2Thread1of1ForFork0_#t~mem15#1=|v_thread2Thread1of1ForFork0_#t~mem15#1_45|, ~n~0=v_~n~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem13#1, ~x2~0, thread2Thread1of1ForFork0_#t~post16#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~post12#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~mem11#1, thread2Thread1of1ForFork0_#t~post14#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~mem15#1] and [882] L49-2-->L49-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_8|) (= v_~x1~0_Out_12 (select (select |v_#memory_int_In_39| v_~f~0.base_In_27) (+ v_~f~0.offset_In_27 (* v_~x1~0_In_7 4)))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_6| 4294967296) (mod v_~n~0_In_7 4294967296)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_20) (<= 0 v_~x1~0_In_7)) 1 0))) InVars {~size~0=v_~size~0_In_20, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_6|, ~f~0.base=v_~f~0.base_In_27, #memory_int=|v_#memory_int_In_39|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_27} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_10|, ~size~0=v_~size~0_In_20, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_4|, ~f~0.base=v_~f~0.base_In_27, #memory_int=|v_#memory_int_In_39|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_14|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_Out_12, ~f~0.offset=v_~f~0.offset_In_27, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:47:19,237 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:19,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2976 [2022-12-06 05:47:19,238 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 189 flow [2022-12-06 05:47:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:19,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:19,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:19,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:47:19,239 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:19,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash -305877311, now seen corresponding path program 1 times [2022-12-06 05:47:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:19,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793266350] [2022-12-06 05:47:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:19,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793266350] [2022-12-06 05:47:19,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793266350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:19,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:19,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925491273] [2022-12-06 05:47:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:19,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:19,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:47:19,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:19,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:19,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:47:19,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:19,445 INFO L130 PetriNetUnfolder]: 199/397 cut-off events. [2022-12-06 05:47:19,445 INFO L131 PetriNetUnfolder]: For 1198/1198 co-relation queries the response was YES. [2022-12-06 05:47:19,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 397 events. 199/397 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1752 event pairs, 137 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 1172. Up to 391 conditions per place. [2022-12-06 05:47:19,447 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 05:47:19,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 270 flow [2022-12-06 05:47:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:47:19,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2022-12-06 05:47:19,448 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 189 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:47:19,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 270 flow [2022-12-06 05:47:19,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 243 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 05:47:19,451 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 181 flow [2022-12-06 05:47:19,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-06 05:47:19,451 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 05:47:19,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:19,452 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 181 flow [2022-12-06 05:47:19,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:19,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:19,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 181 flow [2022-12-06 05:47:19,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 181 flow [2022-12-06 05:47:19,462 INFO L130 PetriNetUnfolder]: 11/96 cut-off events. [2022-12-06 05:47:19,462 INFO L131 PetriNetUnfolder]: For 92/104 co-relation queries the response was YES. [2022-12-06 05:47:19,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 96 events. 11/96 cut-off events. For 92/104 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 489 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 170. Up to 14 conditions per place. [2022-12-06 05:47:19,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 181 flow [2022-12-06 05:47:19,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 05:47:24,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:24,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4860 [2022-12-06 05:47:24,311 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 182 flow [2022-12-06 05:47:24,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:24,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:24,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:24,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:47:24,312 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -594015863, now seen corresponding path program 1 times [2022-12-06 05:47:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:24,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727223918] [2022-12-06 05:47:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727223918] [2022-12-06 05:47:24,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727223918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:24,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:24,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768381803] [2022-12-06 05:47:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:24,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:24,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:47:24,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:24,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:24,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:47:24,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:24,553 INFO L130 PetriNetUnfolder]: 194/376 cut-off events. [2022-12-06 05:47:24,553 INFO L131 PetriNetUnfolder]: For 1000/1000 co-relation queries the response was YES. [2022-12-06 05:47:24,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 376 events. 194/376 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1565 event pairs, 125 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 1223. Up to 325 conditions per place. [2022-12-06 05:47:24,555 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 35 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-12-06 05:47:24,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 288 flow [2022-12-06 05:47:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 05:47:24,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 05:47:24,556 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 182 flow. Second operand 3 states and 36 transitions. [2022-12-06 05:47:24,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 288 flow [2022-12-06 05:47:24,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 268 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:24,558 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 176 flow [2022-12-06 05:47:24,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 05:47:24,559 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 05:47:24,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:24,559 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 176 flow [2022-12-06 05:47:24,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:24,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:24,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 176 flow [2022-12-06 05:47:24,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 176 flow [2022-12-06 05:47:24,569 INFO L130 PetriNetUnfolder]: 12/85 cut-off events. [2022-12-06 05:47:24,569 INFO L131 PetriNetUnfolder]: For 131/148 co-relation queries the response was YES. [2022-12-06 05:47:24,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 85 events. 12/85 cut-off events. For 131/148 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 380 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 146. Up to 12 conditions per place. [2022-12-06 05:47:24,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 176 flow [2022-12-06 05:47:24,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 05:47:24,570 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:24,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:47:24,571 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 176 flow [2022-12-06 05:47:24,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:24,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:24,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:47:24,571 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1660019772, now seen corresponding path program 1 times [2022-12-06 05:47:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:24,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929169955] [2022-12-06 05:47:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:24,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929169955] [2022-12-06 05:47:24,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929169955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:24,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:24,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053567155] [2022-12-06 05:47:24,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:24,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:24,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:47:24,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:24,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:24,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:47:24,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:24,844 INFO L130 PetriNetUnfolder]: 197/383 cut-off events. [2022-12-06 05:47:24,844 INFO L131 PetriNetUnfolder]: For 970/970 co-relation queries the response was YES. [2022-12-06 05:47:24,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 383 events. 197/383 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1617 event pairs, 135 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 1091. Up to 377 conditions per place. [2022-12-06 05:47:24,846 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 31 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 05:47:24,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 257 flow [2022-12-06 05:47:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:47:24,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2022-12-06 05:47:24,846 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 176 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:47:24,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 257 flow [2022-12-06 05:47:24,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:24,848 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 191 flow [2022-12-06 05:47:24,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-06 05:47:24,848 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 05:47:24,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:24,848 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 191 flow [2022-12-06 05:47:24,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:24,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:24,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 191 flow [2022-12-06 05:47:24,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 191 flow [2022-12-06 05:47:24,857 INFO L130 PetriNetUnfolder]: 11/86 cut-off events. [2022-12-06 05:47:24,857 INFO L131 PetriNetUnfolder]: For 121/138 co-relation queries the response was YES. [2022-12-06 05:47:24,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 86 events. 11/86 cut-off events. For 121/138 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 402 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 165. Up to 12 conditions per place. [2022-12-06 05:47:24,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 191 flow [2022-12-06 05:47:24,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 05:47:32,372 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:32,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7525 [2022-12-06 05:47:32,373 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 192 flow [2022-12-06 05:47:32,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:32,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:32,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:32,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:47:32,373 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1443766664, now seen corresponding path program 1 times [2022-12-06 05:47:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:32,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176592619] [2022-12-06 05:47:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:32,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176592619] [2022-12-06 05:47:32,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176592619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:32,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:32,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973876480] [2022-12-06 05:47:32,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:32,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:32,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:32,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:32,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:47:32,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:32,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:32,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:47:32,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:32,674 INFO L130 PetriNetUnfolder]: 196/382 cut-off events. [2022-12-06 05:47:32,674 INFO L131 PetriNetUnfolder]: For 1132/1132 co-relation queries the response was YES. [2022-12-06 05:47:32,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 382 events. 196/382 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1699 event pairs, 89 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1275. Up to 259 conditions per place. [2022-12-06 05:47:32,676 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 38 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2022-12-06 05:47:32,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 343 flow [2022-12-06 05:47:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 05:47:32,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-06 05:47:32,677 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 192 flow. Second operand 4 states and 43 transitions. [2022-12-06 05:47:32,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 343 flow [2022-12-06 05:47:32,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 319 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:32,678 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 195 flow [2022-12-06 05:47:32,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-06 05:47:32,680 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 05:47:32,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:32,680 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 195 flow [2022-12-06 05:47:32,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:32,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:32,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 195 flow [2022-12-06 05:47:32,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 195 flow [2022-12-06 05:47:32,690 INFO L130 PetriNetUnfolder]: 12/87 cut-off events. [2022-12-06 05:47:32,690 INFO L131 PetriNetUnfolder]: For 135/156 co-relation queries the response was YES. [2022-12-06 05:47:32,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 87 events. 12/87 cut-off events. For 135/156 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 400 event pairs, 2 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 169. Up to 14 conditions per place. [2022-12-06 05:47:32,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 195 flow [2022-12-06 05:47:32,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 05:47:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:47:33,053 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork0_~i~1#1_358 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:47:33,055 INFO L158 Benchmark]: Toolchain (without parser) took 41743.09ms. Allocated memory was 192.9MB in the beginning and 634.4MB in the end (delta: 441.5MB). Free memory was 169.1MB in the beginning and 495.9MB in the end (delta: -326.8MB). Peak memory consumption was 114.1MB. Max. memory is 8.0GB. [2022-12-06 05:47:33,055 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:47:33,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.08ms. Allocated memory is still 192.9MB. Free memory was 168.6MB in the beginning and 157.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:47:33,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.51ms. Allocated memory is still 192.9MB. Free memory was 157.0MB in the beginning and 154.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:47:33,056 INFO L158 Benchmark]: Boogie Preprocessor took 28.83ms. Allocated memory is still 192.9MB. Free memory was 154.9MB in the beginning and 153.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:47:33,056 INFO L158 Benchmark]: RCFGBuilder took 498.80ms. Allocated memory is still 192.9MB. Free memory was 153.3MB in the beginning and 134.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-06 05:47:33,056 INFO L158 Benchmark]: TraceAbstraction took 40924.59ms. Allocated memory was 192.9MB in the beginning and 634.4MB in the end (delta: 441.5MB). Free memory was 133.4MB in the beginning and 495.9MB in the end (delta: -362.5MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2022-12-06 05:47:33,057 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.08ms. Allocated memory is still 192.9MB. Free memory was 168.6MB in the beginning and 157.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.51ms. Allocated memory is still 192.9MB. Free memory was 157.0MB in the beginning and 154.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.83ms. Allocated memory is still 192.9MB. Free memory was 154.9MB in the beginning and 153.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 498.80ms. Allocated memory is still 192.9MB. Free memory was 153.3MB in the beginning and 134.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 40924.59ms. Allocated memory was 192.9MB in the beginning and 634.4MB in the end (delta: 441.5MB). Free memory was 133.4MB in the beginning and 495.9MB in the end (delta: -362.5MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 195 PlacesBefore, 21 PlacesAfterwards, 209 TransitionsBefore, 17 TransitionsAfterwards, 5492 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 110 ConcurrentYvCompositions, 15 ChoiceCompositions, 189 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 3349, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 0, independent unconditional: 3349, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 0, independent unconditional: 3349, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3350, independent: 3349, independent conditional: 0, independent unconditional: 3349, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3038, independent: 3037, independent conditional: 0, independent unconditional: 3037, 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: 3038, independent: 3037, independent conditional: 0, independent unconditional: 3037, 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: 3350, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3038, unknown conditional: 0, unknown unconditional: 3038] , Statistics on independence cache: Total cache size (in pairs): 5958, Positive cache size: 5957, Positive conditional cache size: 0, Positive unconditional cache size: 5957, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 24 PlacesBefore, 22 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 17, Positive cache size: 17, Positive conditional cache size: 7, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 10, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 28, Positive cache size: 28, Positive conditional cache size: 17, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 30 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 17, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 20, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 33 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 20, Positive unconditional cache size: 29, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 59, Positive conditional cache size: 23, Positive unconditional cache size: 36, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 26, independent conditional: 8, independent unconditional: 18, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 65, Positive conditional cache size: 25, Positive unconditional cache size: 40, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 40 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 15, independent conditional: 7, independent unconditional: 8, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 68, Positive conditional cache size: 28, Positive unconditional cache size: 40, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 42 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 28, independent conditional: 14, independent unconditional: 14, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 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: 39, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 82, Positive conditional cache size: 38, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 40 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 85, Positive conditional cache size: 41, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 85, Positive conditional cache size: 41, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 42 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 88, Positive conditional cache size: 44, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork0_~i~1#1_358 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork0_~i~1#1_358 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:47:33,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...