/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:24:46,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:24:46,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:24:46,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:24:46,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:24:46,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:24:46,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:24:46,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:24:46,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:24:46,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:24:46,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:24:46,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:24:46,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:24:46,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:24:46,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:24:46,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:24:46,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:24:46,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:24:46,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:24:46,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:24:46,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:24:46,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:24:46,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:24:46,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:24:46,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:24:46,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:24:46,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:24:46,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:24:46,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:24:46,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:24:46,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:24:46,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:24:46,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:24:46,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:24:46,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:24:46,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:24:46,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:24:46,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:24:46,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:24:46,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:24:46,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:24:46,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:24:46,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:24:46,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:24:46,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:24:46,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:24:46,489 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:24:46,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:24:46,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:24:46,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:24:46,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:24:46,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:24:46,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:24:46,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:46,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:24:46,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:24:46,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:24:46,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:24:46,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:24:46,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:24:46,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:24:46,781 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:24:46,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-06 07:24:47,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:24:48,009 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:24:48,010 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-06 07:24:48,023 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb910193/ad5be46f55c247da8c125818978fb94e/FLAGc1cac9b8b [2022-12-06 07:24:48,050 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb910193/ad5be46f55c247da8c125818978fb94e [2022-12-06 07:24:48,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:24:48,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:24:48,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:48,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:24:48,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:24:48,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632b6986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48, skipping insertion in model container [2022-12-06 07:24:48,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:24:48,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:24:48,225 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/clever.wvr.c[2133,2146] [2022-12-06 07:24:48,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:48,235 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:24:48,262 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/clever.wvr.c[2133,2146] [2022-12-06 07:24:48,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:48,274 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:24:48,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48 WrapperNode [2022-12-06 07:24:48,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:48,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:48,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:24:48,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:24:48,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,313 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2022-12-06 07:24:48,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:48,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:24:48,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:24:48,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:24:48,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,341 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:24:48,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:24:48,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:24:48,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:24:48,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (1/1) ... [2022-12-06 07:24:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:48,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:48,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:24:48,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:24:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:24:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:24:48,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:24:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:24:48,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:24:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:24:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:24:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:24:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:24:48,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:24:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:24:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:24:48,422 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:24:48,508 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:24:48,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:24:48,679 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:24:48,684 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:24:48,684 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:24:48,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:48 BoogieIcfgContainer [2022-12-06 07:24:48,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:24:48,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:24:48,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:24:48,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:24:48,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:24:48" (1/3) ... [2022-12-06 07:24:48,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ac384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:48, skipping insertion in model container [2022-12-06 07:24:48,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:48" (2/3) ... [2022-12-06 07:24:48,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ac384c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:48, skipping insertion in model container [2022-12-06 07:24:48,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:48" (3/3) ... [2022-12-06 07:24:48,698 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2022-12-06 07:24:48,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:24:48,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:24:48,729 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:24:48,811 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:24:48,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 240 flow [2022-12-06 07:24:48,897 INFO L130 PetriNetUnfolder]: 9/110 cut-off events. [2022-12-06 07:24:48,898 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:48,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 9/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 07:24:48,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 112 transitions, 240 flow [2022-12-06 07:24:48,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 216 flow [2022-12-06 07:24:48,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:48,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-06 07:24:48,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 102 transitions, 216 flow [2022-12-06 07:24:48,963 INFO L130 PetriNetUnfolder]: 9/102 cut-off events. [2022-12-06 07:24:48,964 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:48,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 102 events. 9/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 07:24:48,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-06 07:24:48,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-06 07:24:52,390 INFO L203 LiptonReduction]: Total number of compositions: 87 [2022-12-06 07:24:52,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:24:52,405 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;@525cfec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:24:52,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:24:52,408 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 07:24:52,408 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:24:52,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:52,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:52,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1941019273, now seen corresponding path program 1 times [2022-12-06 07:24:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:52,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593387734] [2022-12-06 07:24:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:52,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593387734] [2022-12-06 07:24:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593387734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:52,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:24:52,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136387451] [2022-12-06 07:24:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:52,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:24:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:24:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:24:52,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:24:52,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:52,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:52,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:24:52,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:52,855 INFO L130 PetriNetUnfolder]: 69/117 cut-off events. [2022-12-06 07:24:52,855 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 07:24:52,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 117 events. 69/117 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 282 event pairs, 15 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 204. Up to 73 conditions per place. [2022-12-06 07:24:52,856 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 07:24:52,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 129 flow [2022-12-06 07:24:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:24:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:24:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 07:24:52,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2022-12-06 07:24:52,866 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 28 transitions. [2022-12-06 07:24:52,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 129 flow [2022-12-06 07:24:52,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:24:52,879 INFO L231 Difference]: Finished difference. Result has 18 places, 17 transitions, 53 flow [2022-12-06 07:24:52,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=18, PETRI_TRANSITIONS=17} [2022-12-06 07:24:52,884 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-06 07:24:52,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:52,885 INFO L89 Accepts]: Start accepts. Operand has 18 places, 17 transitions, 53 flow [2022-12-06 07:24:52,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:52,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:52,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-06 07:24:52,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 17 transitions, 53 flow [2022-12-06 07:24:52,899 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 07:24:52,899 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:24:52,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 9/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 10 conditions per place. [2022-12-06 07:24:52,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-06 07:24:52,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 07:24:52,901 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:52,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:24:52,902 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 17 transitions, 53 flow [2022-12-06 07:24:52,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:52,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:52,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:52,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:24:52,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1677528037, now seen corresponding path program 1 times [2022-12-06 07:24:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:52,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359044134] [2022-12-06 07:24:52,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:53,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359044134] [2022-12-06 07:24:53,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359044134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:53,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:53,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78586648] [2022-12-06 07:24:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:53,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:53,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:24:53,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:53,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:24:53,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:53,095 INFO L130 PetriNetUnfolder]: 125/216 cut-off events. [2022-12-06 07:24:53,095 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-06 07:24:53,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 216 events. 125/216 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 686 event pairs, 11 based on Foata normal form. 8/202 useless extension candidates. Maximal degree in co-relation 181. Up to 79 conditions per place. [2022-12-06 07:24:53,097 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 40 selfloop transitions, 7 changer transitions 2/49 dead transitions. [2022-12-06 07:24:53,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 49 transitions, 242 flow [2022-12-06 07:24:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:24:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:24:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 07:24:53,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-06 07:24:53,098 INFO L175 Difference]: Start difference. First operand has 18 places, 17 transitions, 53 flow. Second operand 5 states and 44 transitions. [2022-12-06 07:24:53,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 49 transitions, 242 flow [2022-12-06 07:24:53,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:53,100 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 101 flow [2022-12-06 07:24:53,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2022-12-06 07:24:53,100 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-06 07:24:53,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:53,101 INFO L89 Accepts]: Start accepts. Operand has 24 places, 23 transitions, 101 flow [2022-12-06 07:24:53,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:53,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:53,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-06 07:24:53,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 101 flow [2022-12-06 07:24:53,107 INFO L130 PetriNetUnfolder]: 29/79 cut-off events. [2022-12-06 07:24:53,107 INFO L131 PetriNetUnfolder]: For 23/36 co-relation queries the response was YES. [2022-12-06 07:24:53,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 79 events. 29/79 cut-off events. For 23/36 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 250 event pairs, 1 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 136. Up to 19 conditions per place. [2022-12-06 07:24:53,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-06 07:24:53,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 07:24:53,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L51-1-->thread2EXIT: Formula: (and (not (< v_~i2~0_In_3 v_~n~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_3, ~i2~0=v_~i2~0_In_3} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, ~i2~0=v_~i2~0_In_3, ~n~0=v_~n~0_In_3, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 07:24:53,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:24:53,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:24:53,182 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 105 flow [2022-12-06 07:24:53,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,182 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:53,182 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:53,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:24:53,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1006824449, now seen corresponding path program 2 times [2022-12-06 07:24:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:53,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338677093] [2022-12-06 07:24:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:53,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338677093] [2022-12-06 07:24:53,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338677093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:53,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:53,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507809894] [2022-12-06 07:24:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:53,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:53,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:53,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:53,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:24:53,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:53,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:24:53,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:53,271 INFO L130 PetriNetUnfolder]: 111/192 cut-off events. [2022-12-06 07:24:53,271 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-06 07:24:53,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 192 events. 111/192 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 570 event pairs, 7 based on Foata normal form. 4/188 useless extension candidates. Maximal degree in co-relation 249. Up to 76 conditions per place. [2022-12-06 07:24:53,272 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 32 selfloop transitions, 10 changer transitions 6/48 dead transitions. [2022-12-06 07:24:53,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 298 flow [2022-12-06 07:24:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:24:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:24:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:24:53,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 07:24:53,273 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 105 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:24:53,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 298 flow [2022-12-06 07:24:53,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 48 transitions, 294 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 07:24:53,275 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 154 flow [2022-12-06 07:24:53,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-06 07:24:53,276 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2022-12-06 07:24:53,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:53,276 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 154 flow [2022-12-06 07:24:53,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:53,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:53,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-06 07:24:53,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 154 flow [2022-12-06 07:24:53,282 INFO L130 PetriNetUnfolder]: 31/74 cut-off events. [2022-12-06 07:24:53,282 INFO L131 PetriNetUnfolder]: For 69/77 co-relation queries the response was YES. [2022-12-06 07:24:53,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 74 events. 31/74 cut-off events. For 69/77 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 211 event pairs, 2 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 186. Up to 25 conditions per place. [2022-12-06 07:24:53,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-06 07:24:53,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 07:24:53,284 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:53,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 07:24:53,284 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 154 flow [2022-12-06 07:24:53,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:53,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:53,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:24:53,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1476743439, now seen corresponding path program 1 times [2022-12-06 07:24:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:53,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048478301] [2022-12-06 07:24:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:24:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:53,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048478301] [2022-12-06 07:24:53,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048478301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:53,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:53,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314790052] [2022-12-06 07:24:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:53,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:53,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:24:53,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:53,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:24:53,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:53,372 INFO L130 PetriNetUnfolder]: 116/209 cut-off events. [2022-12-06 07:24:53,372 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-06 07:24:53,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 209 events. 116/209 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 636 event pairs, 22 based on Foata normal form. 10/219 useless extension candidates. Maximal degree in co-relation 399. Up to 68 conditions per place. [2022-12-06 07:24:53,373 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 37 selfloop transitions, 6 changer transitions 6/49 dead transitions. [2022-12-06 07:24:53,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 362 flow [2022-12-06 07:24:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:24:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:24:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:24:53,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 07:24:53,375 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 154 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:24:53,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 362 flow [2022-12-06 07:24:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 354 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 07:24:53,377 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 206 flow [2022-12-06 07:24:53,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-06 07:24:53,378 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 19 predicate places. [2022-12-06 07:24:53,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:53,378 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 206 flow [2022-12-06 07:24:53,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:53,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:53,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-06 07:24:53,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 206 flow [2022-12-06 07:24:53,384 INFO L130 PetriNetUnfolder]: 21/65 cut-off events. [2022-12-06 07:24:53,384 INFO L131 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-12-06 07:24:53,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 65 events. 21/65 cut-off events. For 117/120 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 1 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 178. Up to 18 conditions per place. [2022-12-06 07:24:53,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-06 07:24:53,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 07:24:53,386 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:53,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 07:24:53,386 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 206 flow [2022-12-06 07:24:53,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:53,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:53,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:24:53,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:53,387 INFO L85 PathProgramCache]: Analyzing trace with hash -617492605, now seen corresponding path program 2 times [2022-12-06 07:24:53,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:53,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344300714] [2022-12-06 07:24:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:53,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344300714] [2022-12-06 07:24:53,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344300714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:53,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:53,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851654977] [2022-12-06 07:24:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:53,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:53,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:53,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:24:53,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:53,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:24:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:53,470 INFO L130 PetriNetUnfolder]: 88/150 cut-off events. [2022-12-06 07:24:53,470 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2022-12-06 07:24:53,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 150 events. 88/150 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 391 event pairs, 6 based on Foata normal form. 4/154 useless extension candidates. Maximal degree in co-relation 523. Up to 75 conditions per place. [2022-12-06 07:24:53,471 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 30 selfloop transitions, 5 changer transitions 5/40 dead transitions. [2022-12-06 07:24:53,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 327 flow [2022-12-06 07:24:53,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:24:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:24:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 07:24:53,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 07:24:53,472 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 206 flow. Second operand 4 states and 33 transitions. [2022-12-06 07:24:53,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 327 flow [2022-12-06 07:24:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 325 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 07:24:53,475 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 194 flow [2022-12-06 07:24:53,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 07:24:53,476 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2022-12-06 07:24:53,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:53,476 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 194 flow [2022-12-06 07:24:53,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:53,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:53,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 194 flow [2022-12-06 07:24:53,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 194 flow [2022-12-06 07:24:53,481 INFO L130 PetriNetUnfolder]: 21/48 cut-off events. [2022-12-06 07:24:53,481 INFO L131 PetriNetUnfolder]: For 107/110 co-relation queries the response was YES. [2022-12-06 07:24:53,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 48 events. 21/48 cut-off events. For 107/110 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 146. Up to 17 conditions per place. [2022-12-06 07:24:53,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 194 flow [2022-12-06 07:24:53,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 07:24:53,482 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:53,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:24:53,483 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 194 flow [2022-12-06 07:24:53,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:53,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:53,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:53,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:24:53,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:24:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1669050343, now seen corresponding path program 1 times [2022-12-06 07:24:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:53,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073339547] [2022-12-06 07:24:53,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073339547] [2022-12-06 07:24:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073339547] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:24:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341712890] [2022-12-06 07:24:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:53,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:24:53,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:24:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:53,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:24:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:24:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:58,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:24:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:24:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341712890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:24:58,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:24:58,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:24:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002558458] [2022-12-06 07:24:58,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:24:58,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:24:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:24:58,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=109, Unknown=2, NotChecked=0, Total=156 [2022-12-06 07:24:58,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:24:58,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 194 flow. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:58,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:58,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:24:58,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:59,610 INFO L130 PetriNetUnfolder]: 382/661 cut-off events. [2022-12-06 07:24:59,610 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-12-06 07:24:59,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 661 events. 382/661 cut-off events. For 1303/1303 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2750 event pairs, 2 based on Foata normal form. 6/667 useless extension candidates. Maximal degree in co-relation 1335. Up to 222 conditions per place. [2022-12-06 07:24:59,614 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 102 selfloop transitions, 69 changer transitions 49/220 dead transitions. [2022-12-06 07:24:59,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 220 transitions, 1850 flow [2022-12-06 07:24:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:24:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:24:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 188 transitions. [2022-12-06 07:24:59,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5820433436532507 [2022-12-06 07:24:59,616 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 194 flow. Second operand 19 states and 188 transitions. [2022-12-06 07:24:59,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 220 transitions, 1850 flow [2022-12-06 07:24:59,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 220 transitions, 1787 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 07:24:59,623 INFO L231 Difference]: Finished difference. Result has 66 places, 109 transitions, 1156 flow [2022-12-06 07:24:59,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1156, PETRI_PLACES=66, PETRI_TRANSITIONS=109} [2022-12-06 07:24:59,624 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 47 predicate places. [2022-12-06 07:24:59,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:59,624 INFO L89 Accepts]: Start accepts. Operand has 66 places, 109 transitions, 1156 flow [2022-12-06 07:24:59,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:59,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:59,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-06 07:24:59,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 109 transitions, 1156 flow [2022-12-06 07:24:59,646 INFO L130 PetriNetUnfolder]: 111/253 cut-off events. [2022-12-06 07:24:59,647 INFO L131 PetriNetUnfolder]: For 922/927 co-relation queries the response was YES. [2022-12-06 07:24:59,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 253 events. 111/253 cut-off events. For 922/927 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1097 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 1104. Up to 92 conditions per place. [2022-12-06 07:24:59,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-06 07:24:59,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 07:24:59,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:24:59,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L40-1-->L41-6: Formula: (and (= (+ v_~k1~0_80 1) v_~k1~0_79) (< v_~i1~0_71 v_~n~0_55) (< v_~j1~0_71 (+ v_~m~0_65 1)) (= v_~j1~0_71 1)) InVars {~m~0=v_~m~0_65, ~k1~0=v_~k1~0_80, ~i1~0=v_~i1~0_71, ~n~0=v_~n~0_55} OutVars{~m~0=v_~m~0_65, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_20|, ~k1~0=v_~k1~0_79, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_22|, ~j1~0=v_~j1~0_71, ~i1~0=v_~i1~0_71, ~n~0=v_~n~0_55} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:00,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:00,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 07:25:00,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] L40-1-->L51-1: Formula: (and (< v_~i1~0_77 v_~n~0_59) (= (+ v_~m~0_69 v_~k2~0_68) v_~k2~0_67) (= v_~j1~0_77 0) (= v_~i2~0_65 (+ v_~i2~0_66 1)) (< v_~i2~0_66 v_~n~0_59)) InVars {~m~0=v_~m~0_69, ~k2~0=v_~k2~0_68, ~i2~0=v_~i2~0_66, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_21|, ~m~0=v_~m~0_69, ~k2~0=v_~k2~0_67, ~i2~0=v_~i2~0_65, ~j1~0=v_~j1~0_77, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0, ~j1~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 07:25:00,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] L40-1-->L51-1: Formula: (and (< v_~i1~0_77 v_~n~0_59) (= (+ v_~m~0_69 v_~k2~0_68) v_~k2~0_67) (= v_~j1~0_77 0) (= v_~i2~0_65 (+ v_~i2~0_66 1)) (< v_~i2~0_66 v_~n~0_59)) InVars {~m~0=v_~m~0_69, ~k2~0=v_~k2~0_68, ~i2~0=v_~i2~0_66, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_21|, ~m~0=v_~m~0_69, ~k2~0=v_~k2~0_67, ~i2~0=v_~i2~0_65, ~j1~0=v_~j1~0_77, ~i1~0=v_~i1~0_77, ~n~0=v_~n~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0, ~j1~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 07:25:00,308 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:25:00,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 685 [2022-12-06 07:25:00,309 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 107 transitions, 1216 flow [2022-12-06 07:25:00,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:00,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:00,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:00,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:00,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 07:25:00,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1093522903, now seen corresponding path program 2 times [2022-12-06 07:25:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:00,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413669729] [2022-12-06 07:25:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:00,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413669729] [2022-12-06 07:25:00,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413669729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:00,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064759189] [2022-12-06 07:25:00,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:25:00,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:00,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:00,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:00,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:25:00,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:25:00,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:25:00,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:25:00,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:03,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:03,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064759189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:03,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:03,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:25:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093462745] [2022-12-06 07:25:03,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:03,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:25:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:25:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=106, Unknown=1, NotChecked=0, Total=156 [2022-12-06 07:25:03,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:25:03,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 107 transitions, 1216 flow. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:03,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:03,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:25:03,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:04,608 INFO L130 PetriNetUnfolder]: 977/1703 cut-off events. [2022-12-06 07:25:04,608 INFO L131 PetriNetUnfolder]: For 6556/6556 co-relation queries the response was YES. [2022-12-06 07:25:04,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8965 conditions, 1703 events. 977/1703 cut-off events. For 6556/6556 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9002 event pairs, 0 based on Foata normal form. 6/1709 useless extension candidates. Maximal degree in co-relation 7908. Up to 600 conditions per place. [2022-12-06 07:25:04,618 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 167 selfloop transitions, 181 changer transitions 30/378 dead transitions. [2022-12-06 07:25:04,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 378 transitions, 4575 flow [2022-12-06 07:25:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:25:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:25:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-12-06 07:25:04,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3826530612244898 [2022-12-06 07:25:04,622 INFO L175 Difference]: Start difference. First operand has 64 places, 107 transitions, 1216 flow. Second operand 14 states and 150 transitions. [2022-12-06 07:25:04,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 378 transitions, 4575 flow [2022-12-06 07:25:04,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 378 transitions, 4070 flow, removed 230 selfloop flow, removed 5 redundant places. [2022-12-06 07:25:04,652 INFO L231 Difference]: Finished difference. Result has 83 places, 259 transitions, 3282 flow [2022-12-06 07:25:04,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3282, PETRI_PLACES=83, PETRI_TRANSITIONS=259} [2022-12-06 07:25:04,653 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 64 predicate places. [2022-12-06 07:25:04,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:04,653 INFO L89 Accepts]: Start accepts. Operand has 83 places, 259 transitions, 3282 flow [2022-12-06 07:25:04,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:04,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:04,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 259 transitions, 3282 flow [2022-12-06 07:25:04,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 259 transitions, 3282 flow [2022-12-06 07:25:04,730 INFO L130 PetriNetUnfolder]: 297/689 cut-off events. [2022-12-06 07:25:04,731 INFO L131 PetriNetUnfolder]: For 4484/4551 co-relation queries the response was YES. [2022-12-06 07:25:04,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 689 events. 297/689 cut-off events. For 4484/4551 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4032 event pairs, 0 based on Foata normal form. 1/689 useless extension candidates. Maximal degree in co-relation 3523. Up to 262 conditions per place. [2022-12-06 07:25:04,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 259 transitions, 3282 flow [2022-12-06 07:25:04,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-06 07:25:04,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [400] L40-1-->L41-6: Formula: (and (< v_~i1~0_79 v_~n~0_61) (< 1 v_~m~0_71) (= v_~k1~0_83 (+ 2 v_~k1~0_85)) (= 2 v_~j1~0_79)) InVars {~m~0=v_~m~0_71, ~k1~0=v_~k1~0_85, ~i1~0=v_~i1~0_79, ~n~0=v_~n~0_61} OutVars{~m~0=v_~m~0_71, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_22|, ~k1~0=v_~k1~0_83, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_24|, ~j1~0=v_~j1~0_79, ~i1~0=v_~i1~0_79, ~n~0=v_~n~0_61} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:04,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 07:25:04,954 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:04,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-06 07:25:04,955 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 258 transitions, 3300 flow [2022-12-06 07:25:04,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:04,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:04,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:04,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:05,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 07:25:05,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash 20624319, now seen corresponding path program 1 times [2022-12-06 07:25:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:05,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594038737] [2022-12-06 07:25:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594038737] [2022-12-06 07:25:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594038737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376019230] [2022-12-06 07:25:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:05,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:05,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:25:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:05,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:25:05,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:05,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:05,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376019230] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:05,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:25:05,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 7 [2022-12-06 07:25:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213537580] [2022-12-06 07:25:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:05,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:05,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:25:05,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:25:05,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 258 transitions, 3300 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:05,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:05,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:25:05,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:06,273 INFO L130 PetriNetUnfolder]: 996/1731 cut-off events. [2022-12-06 07:25:06,273 INFO L131 PetriNetUnfolder]: For 10802/10802 co-relation queries the response was YES. [2022-12-06 07:25:06,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 1731 events. 996/1731 cut-off events. For 10802/10802 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9221 event pairs, 33 based on Foata normal form. 1/1730 useless extension candidates. Maximal degree in co-relation 9471. Up to 1597 conditions per place. [2022-12-06 07:25:06,285 INFO L137 encePairwiseOnDemand]: 12/32 looper letters, 253 selfloop transitions, 31 changer transitions 8/292 dead transitions. [2022-12-06 07:25:06,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 292 transitions, 4292 flow [2022-12-06 07:25:06,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 07:25:06,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 07:25:06,287 INFO L175 Difference]: Start difference. First operand has 81 places, 258 transitions, 3300 flow. Second operand 4 states and 52 transitions. [2022-12-06 07:25:06,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 292 transitions, 4292 flow [2022-12-06 07:25:06,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 292 transitions, 4147 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-12-06 07:25:06,376 INFO L231 Difference]: Finished difference. Result has 81 places, 266 transitions, 3388 flow [2022-12-06 07:25:06,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3169, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3388, PETRI_PLACES=81, PETRI_TRANSITIONS=266} [2022-12-06 07:25:06,378 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 62 predicate places. [2022-12-06 07:25:06,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:06,378 INFO L89 Accepts]: Start accepts. Operand has 81 places, 266 transitions, 3388 flow [2022-12-06 07:25:06,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:06,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:06,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 266 transitions, 3388 flow [2022-12-06 07:25:06,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 266 transitions, 3388 flow [2022-12-06 07:25:06,435 INFO L130 PetriNetUnfolder]: 314/728 cut-off events. [2022-12-06 07:25:06,435 INFO L131 PetriNetUnfolder]: For 4426/4508 co-relation queries the response was YES. [2022-12-06 07:25:06,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 728 events. 314/728 cut-off events. For 4426/4508 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4337 event pairs, 2 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 3882. Up to 259 conditions per place. [2022-12-06 07:25:06,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 266 transitions, 3388 flow [2022-12-06 07:25:06,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 07:25:06,445 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:06,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 07:25:06,447 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 266 transitions, 3388 flow [2022-12-06 07:25:06,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:06,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:06,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:06,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:06,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1330334046, now seen corresponding path program 1 times [2022-12-06 07:25:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:06,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309998201] [2022-12-06 07:25:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309998201] [2022-12-06 07:25:06,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309998201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51361801] [2022-12-06 07:25:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:06,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:06,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:06,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:25:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:25:07,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:08,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51361801] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:09,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 07:25:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413319607] [2022-12-06 07:25:09,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:09,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:25:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:25:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:25:09,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:25:09,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 266 transitions, 3388 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:09,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:09,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:25:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:11,404 INFO L130 PetriNetUnfolder]: 1208/2108 cut-off events. [2022-12-06 07:25:11,405 INFO L131 PetriNetUnfolder]: For 12114/12114 co-relation queries the response was YES. [2022-12-06 07:25:11,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12641 conditions, 2108 events. 1208/2108 cut-off events. For 12114/12114 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11786 event pairs, 2 based on Foata normal form. 6/2106 useless extension candidates. Maximal degree in co-relation 12535. Up to 1663 conditions per place. [2022-12-06 07:25:11,425 INFO L137 encePairwiseOnDemand]: 9/32 looper letters, 295 selfloop transitions, 94 changer transitions 50/439 dead transitions. [2022-12-06 07:25:11,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 439 transitions, 5931 flow [2022-12-06 07:25:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:25:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:25:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 192 transitions. [2022-12-06 07:25:11,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 07:25:11,427 INFO L175 Difference]: Start difference. First operand has 80 places, 266 transitions, 3388 flow. Second operand 20 states and 192 transitions. [2022-12-06 07:25:11,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 439 transitions, 5931 flow [2022-12-06 07:25:11,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 439 transitions, 5895 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 07:25:11,494 INFO L231 Difference]: Finished difference. Result has 111 places, 332 transitions, 4596 flow [2022-12-06 07:25:11,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3358, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4596, PETRI_PLACES=111, PETRI_TRANSITIONS=332} [2022-12-06 07:25:11,496 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 92 predicate places. [2022-12-06 07:25:11,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:11,496 INFO L89 Accepts]: Start accepts. Operand has 111 places, 332 transitions, 4596 flow [2022-12-06 07:25:11,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:11,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:11,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-06 07:25:11,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 332 transitions, 4596 flow [2022-12-06 07:25:11,576 INFO L130 PetriNetUnfolder]: 378/887 cut-off events. [2022-12-06 07:25:11,576 INFO L131 PetriNetUnfolder]: For 7799/7904 co-relation queries the response was YES. [2022-12-06 07:25:11,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 887 events. 378/887 cut-off events. For 7799/7904 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5650 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 5051. Up to 316 conditions per place. [2022-12-06 07:25:11,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-06 07:25:11,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-06 07:25:11,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:11,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 07:25:11,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:12,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [417] L41-6-->L41-6: Formula: (and (not (< v_~i2~0_114 v_~n~0_95)) (< v_~i1~0_128 v_~n~0_95) (= |v_thread2Thread1of1ForFork1_#res.offset_23| 0) (= |v_thread2Thread1of1ForFork1_#res.base_23| 0) (= v_~j1~0_126 0) (not (< v_~j1~0_127 v_~m~0_105)) (= v_~i1~0_128 (+ v_~i1~0_129 1))) InVars {~m~0=v_~m~0_105, ~i2~0=v_~i2~0_114, ~j1~0=v_~j1~0_127, ~i1~0=v_~i1~0_129, ~n~0=v_~n~0_95} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_23|, ~m~0=v_~m~0_105, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_23|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_51|, ~j1~0=v_~j1~0_126, ~i2~0=v_~i2~0_114, ~i1~0=v_~i1~0_128, ~n~0=v_~n~0_95} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-06 07:25:12,225 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 07:25:12,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [418] L41-6-->L41-6: Formula: (and (= v_~i1~0_132 (+ v_~i1~0_133 1)) (not (< v_~j1~0_131 v_~m~0_107)) (= v_~j1~0_130 0) (< v_~i1~0_132 v_~n~0_97)) InVars {~m~0=v_~m~0_107, ~j1~0=v_~j1~0_131, ~i1~0=v_~i1~0_133, ~n~0=v_~n~0_97} OutVars{~m~0=v_~m~0_107, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_53|, ~j1~0=v_~j1~0_130, ~i1~0=v_~i1~0_132, ~n~0=v_~n~0_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-06 07:25:12,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [419] L41-6-->L51-1: Formula: (and (= v_~k2~0_117 (+ v_~k2~0_118 v_~m~0_109)) (not (< v_~j1~0_134 v_~m~0_109)) (< v_~i2~0_117 v_~n~0_99) (= (+ v_~i2~0_117 1) v_~i2~0_116) (= (+ v_~i1~0_137 1) v_~i1~0_136)) InVars {~m~0=v_~m~0_109, ~k2~0=v_~k2~0_118, ~i2~0=v_~i2~0_117, ~j1~0=v_~j1~0_134, ~i1~0=v_~i1~0_137, ~n~0=v_~n~0_99} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_51|, ~m~0=v_~m~0_109, ~k2~0=v_~k2~0_117, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_55|, ~i2~0=v_~i2~0_116, ~j1~0=v_~j1~0_134, ~i1~0=v_~i1~0_136, ~n~0=v_~n~0_99} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-06 07:25:12,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] [2022-12-06 07:25:12,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 07:25:12,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L40-1-->L40-1: Formula: (and (< v_~i1~0_121 v_~n~0_89) (= v_~j1~0_118 0) (not (< v_~j1~0_118 v_~m~0_99)) (= (+ v_~i1~0_121 1) v_~i1~0_120)) InVars {~m~0=v_~m~0_99, ~i1~0=v_~i1~0_121, ~n~0=v_~n~0_89} OutVars{~m~0=v_~m~0_99, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_49|, ~j1~0=v_~j1~0_118, ~i1~0=v_~i1~0_120, ~n~0=v_~n~0_89} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:12,673 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:25:12,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1178 [2022-12-06 07:25:12,674 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 331 transitions, 4763 flow [2022-12-06 07:25:12,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:12,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:12,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:12,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:12,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:12,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1157178787, now seen corresponding path program 1 times [2022-12-06 07:25:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:12,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406481876] [2022-12-06 07:25:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:12,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406481876] [2022-12-06 07:25:12,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406481876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902371663] [2022-12-06 07:25:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:12,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:12,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:12,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:12,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:25:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:12,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:25:12,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:13,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:13,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902371663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:13,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:13,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 07:25:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955514978] [2022-12-06 07:25:13,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:13,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:25:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:13,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:25:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:25:13,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:25:13,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 331 transitions, 4763 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:13,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:13,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:25:13,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:13,807 INFO L130 PetriNetUnfolder]: 2273/3812 cut-off events. [2022-12-06 07:25:13,808 INFO L131 PetriNetUnfolder]: For 32138/32138 co-relation queries the response was YES. [2022-12-06 07:25:13,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25158 conditions, 3812 events. 2273/3812 cut-off events. For 32138/32138 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 22952 event pairs, 4 based on Foata normal form. 110/3906 useless extension candidates. Maximal degree in co-relation 24961. Up to 1362 conditions per place. [2022-12-06 07:25:13,838 INFO L137 encePairwiseOnDemand]: 12/48 looper letters, 437 selfloop transitions, 424 changer transitions 6/867 dead transitions. [2022-12-06 07:25:13,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 867 transitions, 13303 flow [2022-12-06 07:25:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:25:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:25:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2022-12-06 07:25:13,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1949404761904762 [2022-12-06 07:25:13,840 INFO L175 Difference]: Start difference. First operand has 110 places, 331 transitions, 4763 flow. Second operand 14 states and 131 transitions. [2022-12-06 07:25:13,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 867 transitions, 13303 flow [2022-12-06 07:25:14,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 867 transitions, 12600 flow, removed 335 selfloop flow, removed 5 redundant places. [2022-12-06 07:25:14,024 INFO L231 Difference]: Finished difference. Result has 127 places, 616 transitions, 10167 flow [2022-12-06 07:25:14,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4239, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10167, PETRI_PLACES=127, PETRI_TRANSITIONS=616} [2022-12-06 07:25:14,024 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 108 predicate places. [2022-12-06 07:25:14,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:14,024 INFO L89 Accepts]: Start accepts. Operand has 127 places, 616 transitions, 10167 flow [2022-12-06 07:25:14,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:14,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:14,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 616 transitions, 10167 flow [2022-12-06 07:25:14,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 616 transitions, 10167 flow [2022-12-06 07:25:14,257 INFO L130 PetriNetUnfolder]: 773/1637 cut-off events. [2022-12-06 07:25:14,257 INFO L131 PetriNetUnfolder]: For 22622/24004 co-relation queries the response was YES. [2022-12-06 07:25:14,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11862 conditions, 1637 events. 773/1637 cut-off events. For 22622/24004 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11095 event pairs, 2 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 11539. Up to 640 conditions per place. [2022-12-06 07:25:14,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 616 transitions, 10167 flow [2022-12-06 07:25:14,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 1396 [2022-12-06 07:25:14,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [422] L40-1-->L41-6: Formula: (and (< v_~j1~0_146 (+ v_~m~0_115 1)) (= v_~j1~0_146 4) (= (+ v_~k1~0_137 4) v_~k1~0_135) (< v_~i1~0_142 v_~n~0_103)) InVars {~m~0=v_~m~0_115, ~k1~0=v_~k1~0_137, ~i1~0=v_~i1~0_142, ~n~0=v_~n~0_103} OutVars{~m~0=v_~m~0_115, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_55|, ~k1~0=v_~k1~0_135, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_57|, ~j1~0=v_~j1~0_146, ~i1~0=v_~i1~0_142, ~n~0=v_~n~0_103} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:14,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [427] L51-1-->L51-1: Formula: (and (= v_~k2~0_139 (+ v_~k2~0_141 (* 2 v_~m~0_125))) (= v_~i1~0_152 (+ v_~i1~0_153 1)) (not (< v_~j1~0_162 v_~m~0_125)) (= (+ 2 v_~i2~0_140) v_~i2~0_138) (< (+ v_~i2~0_140 1) v_~n~0_113)) InVars {~m~0=v_~m~0_125, ~k2~0=v_~k2~0_141, ~i2~0=v_~i2~0_140, ~j1~0=v_~j1~0_162, ~i1~0=v_~i1~0_153, ~n~0=v_~n~0_113} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_63|, ~m~0=v_~m~0_125, ~k2~0=v_~k2~0_139, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_61|, ~i2~0=v_~i2~0_138, ~j1~0=v_~j1~0_162, ~i1~0=v_~i1~0_152, ~n~0=v_~n~0_113} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-06 07:25:14,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [425] L51-1-->L41-6: Formula: (and (= (+ v_~i2~0_129 1) v_~i2~0_128) (= v_~i1~0_148 (+ v_~i1~0_149 1)) (not (< v_~j1~0_159 v_~m~0_121)) (< v_~i2~0_129 v_~n~0_109) (< v_~i1~0_148 v_~n~0_109) (= v_~j1~0_158 0) (= v_~k2~0_129 (+ v_~k2~0_130 v_~m~0_121))) InVars {~m~0=v_~m~0_121, ~k2~0=v_~k2~0_130, ~j1~0=v_~j1~0_159, ~i2~0=v_~i2~0_129, ~i1~0=v_~i1~0_149, ~n~0=v_~n~0_109} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_57|, ~m~0=v_~m~0_121, ~k2~0=v_~k2~0_129, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_59|, ~j1~0=v_~j1~0_158, ~i2~0=v_~i2~0_128, ~i1~0=v_~i1~0_148, ~n~0=v_~n~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] [2022-12-06 07:25:14,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [426] L51-1-->L51-1: Formula: (and (= v_~i2~0_132 (+ 2 v_~i2~0_134)) (< (+ v_~i2~0_134 1) v_~n~0_111) (= v_~k2~0_133 (+ (* 2 v_~m~0_123) v_~k2~0_135))) InVars {~m~0=v_~m~0_123, ~k2~0=v_~k2~0_135, ~i2~0=v_~i2~0_134, ~n~0=v_~n~0_111} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_59|, ~m~0=v_~m~0_123, ~k2~0=v_~k2~0_133, ~i2~0=v_~i2~0_132, ~n~0=v_~n~0_111} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:14,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:14,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L40-1-->L41-6: Formula: (and (= v_~k1~0_109 (+ v_~k1~0_111 3)) (< v_~i1~0_114 v_~n~0_83) (= 3 v_~j1~0_110) (< 2 v_~m~0_93)) InVars {~m~0=v_~m~0_93, ~k1~0=v_~k1~0_111, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} OutVars{~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, ~k1~0=v_~k1~0_109, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_39|, ~j1~0=v_~j1~0_110, ~i1~0=v_~i1~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [424] L51-1-->L41-6: Formula: (and (= v_~k1~0_141 (+ v_~k1~0_142 1)) (< v_~i2~0_125 v_~n~0_107) (= v_~k2~0_125 (+ v_~k2~0_126 v_~m~0_119)) (= v_~i2~0_124 (+ v_~i2~0_125 1)) (< v_~j1~0_155 v_~m~0_119) (= (+ v_~j1~0_155 1) v_~j1~0_154)) InVars {~m~0=v_~m~0_119, ~k1~0=v_~k1~0_142, ~k2~0=v_~k2~0_126, ~j1~0=v_~j1~0_155, ~i2~0=v_~i2~0_125, ~n~0=v_~n~0_107} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_55|, ~m~0=v_~m~0_119, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_59|, ~k1~0=v_~k1~0_141, ~k2~0=v_~k2~0_125, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_61|, ~j1~0=v_~j1~0_154, ~i2~0=v_~i2~0_124, ~n~0=v_~n~0_107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0, ~i2~0] [2022-12-06 07:25:14,763 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:14,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 740 [2022-12-06 07:25:14,764 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 616 transitions, 10205 flow [2022-12-06 07:25:14,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:14,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:14,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:14,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 07:25:14,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 07:25:14,965 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash -103742838, now seen corresponding path program 1 times [2022-12-06 07:25:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:14,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745593731] [2022-12-06 07:25:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:15,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745593731] [2022-12-06 07:25:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745593731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:15,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313796707] [2022-12-06 07:25:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:15,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:15,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:15,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:15,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 07:25:15,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 616 transitions, 10205 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 07:25:15,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:15,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 07:25:15,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:15,867 INFO L130 PetriNetUnfolder]: 2288/3801 cut-off events. [2022-12-06 07:25:15,867 INFO L131 PetriNetUnfolder]: For 49635/49635 co-relation queries the response was YES. [2022-12-06 07:25:15,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29191 conditions, 3801 events. 2288/3801 cut-off events. For 49635/49635 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 22377 event pairs, 584 based on Foata normal form. 74/3859 useless extension candidates. Maximal degree in co-relation 29005. Up to 3348 conditions per place. [2022-12-06 07:25:15,893 INFO L137 encePairwiseOnDemand]: 28/48 looper letters, 605 selfloop transitions, 41 changer transitions 0/646 dead transitions. [2022-12-06 07:25:15,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 646 transitions, 12177 flow [2022-12-06 07:25:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 07:25:15,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-06 07:25:15,896 INFO L175 Difference]: Start difference. First operand has 125 places, 616 transitions, 10205 flow. Second operand 4 states and 70 transitions. [2022-12-06 07:25:15,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 646 transitions, 12177 flow [2022-12-06 07:25:16,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 646 transitions, 11466 flow, removed 345 selfloop flow, removed 3 redundant places. [2022-12-06 07:25:16,180 INFO L231 Difference]: Finished difference. Result has 125 places, 598 transitions, 9695 flow [2022-12-06 07:25:16,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9126, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9695, PETRI_PLACES=125, PETRI_TRANSITIONS=598} [2022-12-06 07:25:16,182 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 106 predicate places. [2022-12-06 07:25:16,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:16,183 INFO L89 Accepts]: Start accepts. Operand has 125 places, 598 transitions, 9695 flow [2022-12-06 07:25:16,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:16,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:16,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 598 transitions, 9695 flow [2022-12-06 07:25:16,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 598 transitions, 9695 flow [2022-12-06 07:25:16,375 INFO L130 PetriNetUnfolder]: 781/1632 cut-off events. [2022-12-06 07:25:16,376 INFO L131 PetriNetUnfolder]: For 20841/21160 co-relation queries the response was YES. [2022-12-06 07:25:16,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11723 conditions, 1632 events. 781/1632 cut-off events. For 20841/21160 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10854 event pairs, 5 based on Foata normal form. 6/1631 useless extension candidates. Maximal degree in co-relation 11497. Up to 650 conditions per place. [2022-12-06 07:25:16,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 598 transitions, 9695 flow [2022-12-06 07:25:16,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 1356 [2022-12-06 07:25:16,392 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:16,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 07:25:16,393 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 598 transitions, 9695 flow [2022-12-06 07:25:16,393 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 07:25:16,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:16,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:16,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:25:16,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 435658600, now seen corresponding path program 1 times [2022-12-06 07:25:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:16,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470215298] [2022-12-06 07:25:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:16,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470215298] [2022-12-06 07:25:16,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470215298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:16,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701270039] [2022-12-06 07:25:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:16,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:16,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:25:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:16,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:25:16,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:18,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:18,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701270039] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:18,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 07:25:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719578138] [2022-12-06 07:25:18,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:18,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:25:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:25:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:25:18,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:25:18,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 598 transitions, 9695 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:18,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:18,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:25:18,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:22,717 INFO L130 PetriNetUnfolder]: 2392/3993 cut-off events. [2022-12-06 07:25:22,718 INFO L131 PetriNetUnfolder]: For 44485/44485 co-relation queries the response was YES. [2022-12-06 07:25:22,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29978 conditions, 3993 events. 2392/3993 cut-off events. For 44485/44485 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 24067 event pairs, 14 based on Foata normal form. 2/3977 useless extension candidates. Maximal degree in co-relation 29321. Up to 3580 conditions per place. [2022-12-06 07:25:22,756 INFO L137 encePairwiseOnDemand]: 9/45 looper letters, 577 selfloop transitions, 111 changer transitions 24/712 dead transitions. [2022-12-06 07:25:22,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 712 transitions, 12498 flow [2022-12-06 07:25:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:25:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:25:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-12-06 07:25:22,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19084967320261437 [2022-12-06 07:25:22,758 INFO L175 Difference]: Start difference. First operand has 125 places, 598 transitions, 9695 flow. Second operand 17 states and 146 transitions. [2022-12-06 07:25:22,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 712 transitions, 12498 flow [2022-12-06 07:25:23,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 712 transitions, 12308 flow, removed 82 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:23,050 INFO L231 Difference]: Finished difference. Result has 143 places, 637 transitions, 10500 flow [2022-12-06 07:25:23,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=9590, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10500, PETRI_PLACES=143, PETRI_TRANSITIONS=637} [2022-12-06 07:25:23,051 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 124 predicate places. [2022-12-06 07:25:23,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:23,051 INFO L89 Accepts]: Start accepts. Operand has 143 places, 637 transitions, 10500 flow [2022-12-06 07:25:23,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:23,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:23,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 637 transitions, 10500 flow [2022-12-06 07:25:23,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 637 transitions, 10500 flow [2022-12-06 07:25:23,238 INFO L130 PetriNetUnfolder]: 808/1694 cut-off events. [2022-12-06 07:25:23,238 INFO L131 PetriNetUnfolder]: For 21168/22360 co-relation queries the response was YES. [2022-12-06 07:25:23,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12276 conditions, 1694 events. 808/1694 cut-off events. For 21168/22360 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11446 event pairs, 4 based on Foata normal form. 3/1689 useless extension candidates. Maximal degree in co-relation 12151. Up to 648 conditions per place. [2022-12-06 07:25:23,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 637 transitions, 10500 flow [2022-12-06 07:25:23,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 1458 [2022-12-06 07:25:23,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:23,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L40-1-->L41-6: Formula: (and (< v_~j1~0_142 (+ v_~m~0_113 1)) (= (+ v_~k1~0_131 5) v_~k1~0_129) (< v_~i1~0_140 v_~n~0_101) (= 5 v_~j1~0_142)) InVars {~m~0=v_~m~0_113, ~k1~0=v_~k1~0_131, ~i1~0=v_~i1~0_140, ~n~0=v_~n~0_101} OutVars{~m~0=v_~m~0_113, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_51|, ~k1~0=v_~k1~0_129, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_53|, ~j1~0=v_~j1~0_142, ~i1~0=v_~i1~0_140, ~n~0=v_~n~0_101} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:23,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:23,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 07:25:24,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [436] L40-1-->L41-6: Formula: (and (< v_~i2~0_172 v_~n~0_131) (= v_~j1~0_187 0) (< 2 v_~m~0_143) (= v_~i1~0_184 (+ v_~i1~0_185 1)) (= v_~i2~0_171 (+ v_~i2~0_172 1)) (= (+ v_~k2~0_172 v_~m~0_143) v_~k2~0_171) (= (+ v_~k1~0_159 3) v_~k1~0_158) (<= v_~m~0_143 3) (< v_~i1~0_184 v_~n~0_131)) InVars {~m~0=v_~m~0_143, ~k2~0=v_~k2~0_172, ~k1~0=v_~k1~0_159, ~i2~0=v_~i2~0_172, ~i1~0=v_~i1~0_185, ~n~0=v_~n~0_131} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_82|, ~m~0=v_~m~0_143, ~k2~0=v_~k2~0_171, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_69|, ~k1~0=v_~k1~0_158, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_71|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_75|, ~j1~0=v_~j1~0_187, ~i2~0=v_~i2~0_171, ~i1~0=v_~i1~0_184, ~n~0=v_~n~0_131} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:24,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:24,456 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:25:24,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1406 [2022-12-06 07:25:24,457 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 636 transitions, 10633 flow [2022-12-06 07:25:24,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:24,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:24,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:24,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:24,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:24,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 422726202, now seen corresponding path program 1 times [2022-12-06 07:25:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:24,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078433925] [2022-12-06 07:25:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:24,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078433925] [2022-12-06 07:25:24,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078433925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:24,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980187612] [2022-12-06 07:25:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:24,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:25:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:24,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 07:25:24,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:25,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:25,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980187612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:25,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:25,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2022-12-06 07:25:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165295446] [2022-12-06 07:25:25,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:25,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:25:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:25:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:25:25,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:25:25,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 636 transitions, 10633 flow. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:25,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:25,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:25:25,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:27,193 INFO L130 PetriNetUnfolder]: 2753/4618 cut-off events. [2022-12-06 07:25:27,193 INFO L131 PetriNetUnfolder]: For 51528/51528 co-relation queries the response was YES. [2022-12-06 07:25:27,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35350 conditions, 4618 events. 2753/4618 cut-off events. For 51528/51528 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 28830 event pairs, 6 based on Foata normal form. 8/4602 useless extension candidates. Maximal degree in co-relation 35130. Up to 2824 conditions per place. [2022-12-06 07:25:27,228 INFO L137 encePairwiseOnDemand]: 10/58 looper letters, 382 selfloop transitions, 443 changer transitions 32/857 dead transitions. [2022-12-06 07:25:27,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 857 transitions, 15824 flow [2022-12-06 07:25:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:25:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:25:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-12-06 07:25:27,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1627155172413793 [2022-12-06 07:25:27,230 INFO L175 Difference]: Start difference. First operand has 142 places, 636 transitions, 10633 flow. Second operand 16 states and 151 transitions. [2022-12-06 07:25:27,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 857 transitions, 15824 flow [2022-12-06 07:25:27,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 857 transitions, 15449 flow, removed 138 selfloop flow, removed 6 redundant places. [2022-12-06 07:25:27,660 INFO L231 Difference]: Finished difference. Result has 158 places, 779 transitions, 14682 flow [2022-12-06 07:25:27,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=10266, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=14682, PETRI_PLACES=158, PETRI_TRANSITIONS=779} [2022-12-06 07:25:27,661 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 139 predicate places. [2022-12-06 07:25:27,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:27,661 INFO L89 Accepts]: Start accepts. Operand has 158 places, 779 transitions, 14682 flow [2022-12-06 07:25:27,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:27,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:27,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 779 transitions, 14682 flow [2022-12-06 07:25:27,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 779 transitions, 14682 flow [2022-12-06 07:25:27,914 INFO L130 PetriNetUnfolder]: 916/1897 cut-off events. [2022-12-06 07:25:27,914 INFO L131 PetriNetUnfolder]: For 28659/31167 co-relation queries the response was YES. [2022-12-06 07:25:27,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15390 conditions, 1897 events. 916/1897 cut-off events. For 28659/31167 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12962 event pairs, 1 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 15265. Up to 763 conditions per place. [2022-12-06 07:25:27,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 779 transitions, 14682 flow [2022-12-06 07:25:27,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 1748 [2022-12-06 07:25:27,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] L40-1-->L41-6: Formula: (and (< 2 v_~m~0_169) (< v_~i2~0_207 v_~n~0_155) (= v_~i1~0_215 (+ v_~i1~0_216 1)) (= v_~j1~0_234 1) (= v_~k2~0_205 (+ v_~k2~0_206 v_~m~0_169)) (< v_~i1~0_215 v_~n~0_155) (= v_~i2~0_206 (+ v_~i2~0_207 1)) (<= v_~m~0_169 3) (= v_~k1~0_210 (+ v_~k1~0_212 4))) InVars {~m~0=v_~m~0_169, ~k1~0=v_~k1~0_212, ~k2~0=v_~k2~0_206, ~i2~0=v_~i2~0_207, ~i1~0=v_~i1~0_216, ~n~0=v_~n~0_155} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_100|, ~m~0=v_~m~0_169, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_101|, ~k1~0=v_~k1~0_210, ~k2~0=v_~k2~0_205, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_103|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_85|, ~j1~0=v_~j1~0_234, ~i2~0=v_~i2~0_206, ~i1~0=v_~i1~0_215, ~n~0=v_~n~0_155} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:28,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:28,284 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:25:28,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-06 07:25:28,285 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 777 transitions, 14708 flow [2022-12-06 07:25:28,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:28,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:28,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:28,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 07:25:28,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:28,486 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -673633922, now seen corresponding path program 1 times [2022-12-06 07:25:28,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:28,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901666203] [2022-12-06 07:25:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:28,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901666203] [2022-12-06 07:25:28,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901666203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:28,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616388120] [2022-12-06 07:25:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:28,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:28,664 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:28,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:25:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:28,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:25:28,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:30,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:30,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616388120] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:30,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:30,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 07:25:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228422112] [2022-12-06 07:25:30,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:30,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:25:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:25:30,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:25:30,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:25:30,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 777 transitions, 14708 flow. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:30,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:30,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:25:30,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:32,938 INFO L130 PetriNetUnfolder]: 2907/4856 cut-off events. [2022-12-06 07:25:32,938 INFO L131 PetriNetUnfolder]: For 60393/60393 co-relation queries the response was YES. [2022-12-06 07:25:32,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40456 conditions, 4856 events. 2907/4856 cut-off events. For 60393/60393 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 30479 event pairs, 10 based on Foata normal form. 4/4832 useless extension candidates. Maximal degree in co-relation 40241. Up to 4233 conditions per place. [2022-12-06 07:25:32,975 INFO L137 encePairwiseOnDemand]: 10/61 looper letters, 735 selfloop transitions, 187 changer transitions 34/956 dead transitions. [2022-12-06 07:25:32,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 956 transitions, 19263 flow [2022-12-06 07:25:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 07:25:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 07:25:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 190 transitions. [2022-12-06 07:25:32,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17304189435336975 [2022-12-06 07:25:32,988 INFO L175 Difference]: Start difference. First operand has 153 places, 777 transitions, 14708 flow. Second operand 18 states and 190 transitions. [2022-12-06 07:25:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 956 transitions, 19263 flow [2022-12-06 07:25:33,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 956 transitions, 18477 flow, removed 332 selfloop flow, removed 6 redundant places. [2022-12-06 07:25:33,577 INFO L231 Difference]: Finished difference. Result has 175 places, 853 transitions, 16155 flow [2022-12-06 07:25:33,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=13972, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=16155, PETRI_PLACES=175, PETRI_TRANSITIONS=853} [2022-12-06 07:25:33,578 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 156 predicate places. [2022-12-06 07:25:33,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:33,578 INFO L89 Accepts]: Start accepts. Operand has 175 places, 853 transitions, 16155 flow [2022-12-06 07:25:33,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:33,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:33,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 853 transitions, 16155 flow [2022-12-06 07:25:33,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 853 transitions, 16155 flow [2022-12-06 07:25:33,899 INFO L130 PetriNetUnfolder]: 981/2061 cut-off events. [2022-12-06 07:25:33,900 INFO L131 PetriNetUnfolder]: For 31536/34551 co-relation queries the response was YES. [2022-12-06 07:25:33,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16817 conditions, 2061 events. 981/2061 cut-off events. For 31536/34551 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14605 event pairs, 1 based on Foata normal form. 2/2055 useless extension candidates. Maximal degree in co-relation 16679. Up to 785 conditions per place. [2022-12-06 07:25:33,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 853 transitions, 16155 flow [2022-12-06 07:25:33,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-06 07:25:33,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] L40-1-->L41-6: Formula: (and (= v_~k1~0_194 (+ v_~k1~0_196 7)) (< v_~j1~0_214 (+ v_~m~0_157 1)) (< v_~i1~0_197 v_~n~0_143) (= 7 v_~j1~0_214)) InVars {~m~0=v_~m~0_157, ~k1~0=v_~k1~0_196, ~i1~0=v_~i1~0_197, ~n~0=v_~n~0_143} OutVars{~m~0=v_~m~0_157, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_91|, ~k1~0=v_~k1~0_194, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_93|, ~j1~0=v_~j1~0_214, ~i1~0=v_~i1~0_197, ~n~0=v_~n~0_143} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:34,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 07:25:34,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:34,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:25:34,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [396] L51-1-->L41-6: Formula: (and (= v_~j1~0_68 0) (= |v_thread2Thread1of1ForFork1_#res.offset_11| 0) (= |v_thread2Thread1of1ForFork1_#res.base_11| 0) (< v_~i1~0_68 v_~n~0_53) (not (< v_~i2~0_62 v_~n~0_53))) InVars {~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_11|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_11|, ~j1~0=v_~j1~0_68, ~i2~0=v_~i2~0_62, ~i1~0=v_~i1~0_68, ~n~0=v_~n~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~j1~0] [2022-12-06 07:25:34,316 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:25:34,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 738 [2022-12-06 07:25:34,316 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 853 transitions, 16240 flow [2022-12-06 07:25:34,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:34,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:34,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 07:25:34,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2001142799, now seen corresponding path program 1 times [2022-12-06 07:25:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411645686] [2022-12-06 07:25:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:34,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411645686] [2022-12-06 07:25:34,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411645686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:34,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:25:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749102642] [2022-12-06 07:25:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:34,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 07:25:34,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 853 transitions, 16240 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:34,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:34,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 07:25:34,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:36,072 INFO L130 PetriNetUnfolder]: 3783/6452 cut-off events. [2022-12-06 07:25:36,073 INFO L131 PetriNetUnfolder]: For 92259/92259 co-relation queries the response was YES. [2022-12-06 07:25:36,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53367 conditions, 6452 events. 3783/6452 cut-off events. For 92259/92259 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43274 event pairs, 455 based on Foata normal form. 148/6576 useless extension candidates. Maximal degree in co-relation 53134. Up to 3198 conditions per place. [2022-12-06 07:25:36,120 INFO L137 encePairwiseOnDemand]: 32/68 looper letters, 824 selfloop transitions, 364 changer transitions 5/1193 dead transitions. [2022-12-06 07:25:36,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1193 transitions, 24443 flow [2022-12-06 07:25:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-06 07:25:36,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33455882352941174 [2022-12-06 07:25:36,121 INFO L175 Difference]: Start difference. First operand has 175 places, 853 transitions, 16240 flow. Second operand 4 states and 91 transitions. [2022-12-06 07:25:36,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 1193 transitions, 24443 flow [2022-12-06 07:25:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 1193 transitions, 23876 flow, removed 260 selfloop flow, removed 4 redundant places. [2022-12-06 07:25:36,818 INFO L231 Difference]: Finished difference. Result has 176 places, 1005 transitions, 20183 flow [2022-12-06 07:25:36,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=15131, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=20183, PETRI_PLACES=176, PETRI_TRANSITIONS=1005} [2022-12-06 07:25:36,819 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 157 predicate places. [2022-12-06 07:25:36,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:36,819 INFO L89 Accepts]: Start accepts. Operand has 176 places, 1005 transitions, 20183 flow [2022-12-06 07:25:36,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:36,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:36,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 1005 transitions, 20183 flow [2022-12-06 07:25:36,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 1005 transitions, 20183 flow [2022-12-06 07:25:37,328 INFO L130 PetriNetUnfolder]: 1281/2808 cut-off events. [2022-12-06 07:25:37,328 INFO L131 PetriNetUnfolder]: For 48856/53046 co-relation queries the response was YES. [2022-12-06 07:25:37,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23298 conditions, 2808 events. 1281/2808 cut-off events. For 48856/53046 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 21875 event pairs, 3 based on Foata normal form. 2/2801 useless extension candidates. Maximal degree in co-relation 23161. Up to 992 conditions per place. [2022-12-06 07:25:37,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 1005 transitions, 20183 flow [2022-12-06 07:25:37,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 2220 [2022-12-06 07:25:37,370 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:37,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 552 [2022-12-06 07:25:37,371 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 1005 transitions, 20183 flow [2022-12-06 07:25:37,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:37,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:37,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:25:37,371 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1475064365, now seen corresponding path program 1 times [2022-12-06 07:25:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:37,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880565026] [2022-12-06 07:25:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880565026] [2022-12-06 07:25:37,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880565026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:25:37,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:25:37,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:25:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840977176] [2022-12-06 07:25:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:25:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:25:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:25:37,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:25:37,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 07:25:37,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 1005 transitions, 20183 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:37,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:37,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 07:25:37,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:39,006 INFO L130 PetriNetUnfolder]: 3791/6450 cut-off events. [2022-12-06 07:25:39,006 INFO L131 PetriNetUnfolder]: For 95589/95589 co-relation queries the response was YES. [2022-12-06 07:25:39,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55337 conditions, 6450 events. 3791/6450 cut-off events. For 95589/95589 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 43126 event pairs, 922 based on Foata normal form. 16/6438 useless extension candidates. Maximal degree in co-relation 55119. Up to 5292 conditions per place. [2022-12-06 07:25:39,055 INFO L137 encePairwiseOnDemand]: 41/64 looper letters, 1053 selfloop transitions, 24 changer transitions 0/1077 dead transitions. [2022-12-06 07:25:39,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1077 transitions, 23855 flow [2022-12-06 07:25:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:25:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:25:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 07:25:39,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2022-12-06 07:25:39,056 INFO L175 Difference]: Start difference. First operand has 174 places, 1005 transitions, 20183 flow. Second operand 4 states and 86 transitions. [2022-12-06 07:25:39,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1077 transitions, 23855 flow [2022-12-06 07:25:39,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1077 transitions, 23821 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:39,771 INFO L231 Difference]: Finished difference. Result has 176 places, 1008 transitions, 20279 flow [2022-12-06 07:25:39,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=20149, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=980, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=20279, PETRI_PLACES=176, PETRI_TRANSITIONS=1008} [2022-12-06 07:25:39,772 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 157 predicate places. [2022-12-06 07:25:39,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:39,772 INFO L89 Accepts]: Start accepts. Operand has 176 places, 1008 transitions, 20279 flow [2022-12-06 07:25:39,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:39,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:39,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 1008 transitions, 20279 flow [2022-12-06 07:25:39,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 1008 transitions, 20279 flow [2022-12-06 07:25:40,253 INFO L130 PetriNetUnfolder]: 1285/2810 cut-off events. [2022-12-06 07:25:40,253 INFO L131 PetriNetUnfolder]: For 50001/53462 co-relation queries the response was YES. [2022-12-06 07:25:40,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23481 conditions, 2810 events. 1285/2810 cut-off events. For 50001/53462 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 21715 event pairs, 2 based on Foata normal form. 2/2803 useless extension candidates. Maximal degree in co-relation 23335. Up to 996 conditions per place. [2022-12-06 07:25:40,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 1008 transitions, 20279 flow [2022-12-06 07:25:40,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 2230 [2022-12-06 07:25:40,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:40,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 514 [2022-12-06 07:25:40,286 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 1008 transitions, 20279 flow [2022-12-06 07:25:40,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:40,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:40,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:25:40,287 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:40,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1830476228, now seen corresponding path program 1 times [2022-12-06 07:25:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:40,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536887434] [2022-12-06 07:25:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536887434] [2022-12-06 07:25:40,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536887434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14918021] [2022-12-06 07:25:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:40,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:40,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:25:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:40,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:25:40,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:40,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:40,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14918021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:40,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:40,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 07:25:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084891304] [2022-12-06 07:25:40,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:40,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:25:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:25:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:25:40,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 07:25:40,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 1008 transitions, 20279 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:40,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:40,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 07:25:40,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:42,463 INFO L130 PetriNetUnfolder]: 4221/7232 cut-off events. [2022-12-06 07:25:42,463 INFO L131 PetriNetUnfolder]: For 122867/122867 co-relation queries the response was YES. [2022-12-06 07:25:42,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62708 conditions, 7232 events. 4221/7232 cut-off events. For 122867/122867 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 50071 event pairs, 894 based on Foata normal form. 352/7556 useless extension candidates. Maximal degree in co-relation 62460. Up to 5112 conditions per place. [2022-12-06 07:25:42,516 INFO L137 encePairwiseOnDemand]: 29/64 looper letters, 1079 selfloop transitions, 150 changer transitions 0/1229 dead transitions. [2022-12-06 07:25:42,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1229 transitions, 27343 flow [2022-12-06 07:25:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:25:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:25:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2022-12-06 07:25:42,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2204861111111111 [2022-12-06 07:25:42,517 INFO L175 Difference]: Start difference. First operand has 176 places, 1008 transitions, 20279 flow. Second operand 9 states and 127 transitions. [2022-12-06 07:25:42,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1229 transitions, 27343 flow [2022-12-06 07:25:43,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1229 transitions, 26716 flow, removed 51 selfloop flow, removed 5 redundant places. [2022-12-06 07:25:43,494 INFO L231 Difference]: Finished difference. Result has 183 places, 1015 transitions, 20666 flow [2022-12-06 07:25:43,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=18989, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20666, PETRI_PLACES=183, PETRI_TRANSITIONS=1015} [2022-12-06 07:25:43,501 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 164 predicate places. [2022-12-06 07:25:43,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:43,501 INFO L89 Accepts]: Start accepts. Operand has 183 places, 1015 transitions, 20666 flow [2022-12-06 07:25:43,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:43,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:43,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 1015 transitions, 20666 flow [2022-12-06 07:25:43,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 1015 transitions, 20666 flow [2022-12-06 07:25:44,222 INFO L130 PetriNetUnfolder]: 1407/3104 cut-off events. [2022-12-06 07:25:44,222 INFO L131 PetriNetUnfolder]: For 66924/69471 co-relation queries the response was YES. [2022-12-06 07:25:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27760 conditions, 3104 events. 1407/3104 cut-off events. For 66924/69471 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 24684 event pairs, 15 based on Foata normal form. 5/3101 useless extension candidates. Maximal degree in co-relation 27607. Up to 1256 conditions per place. [2022-12-06 07:25:44,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 1015 transitions, 20666 flow [2022-12-06 07:25:44,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-06 07:25:44,274 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:44,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 777 [2022-12-06 07:25:44,278 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 1015 transitions, 20666 flow [2022-12-06 07:25:44,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:44,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:44,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:44,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:25:44,483 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1714181329, now seen corresponding path program 1 times [2022-12-06 07:25:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:44,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941219425] [2022-12-06 07:25:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941219425] [2022-12-06 07:25:44,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941219425] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735335503] [2022-12-06 07:25:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:44,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:44,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:25:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:44,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:25:44,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:44,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735335503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:44,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 6 [2022-12-06 07:25:44,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130590364] [2022-12-06 07:25:44,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:44,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:25:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:25:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:25:44,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 07:25:44,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1015 transitions, 20666 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:44,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:44,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 07:25:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:46,804 INFO L130 PetriNetUnfolder]: 4869/8462 cut-off events. [2022-12-06 07:25:46,804 INFO L131 PetriNetUnfolder]: For 161803/161803 co-relation queries the response was YES. [2022-12-06 07:25:46,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76592 conditions, 8462 events. 4869/8462 cut-off events. For 161803/161803 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 60612 event pairs, 73 based on Foata normal form. 72/8510 useless extension candidates. Maximal degree in co-relation 76289. Up to 6657 conditions per place. [2022-12-06 07:25:46,872 INFO L137 encePairwiseOnDemand]: 30/62 looper letters, 1123 selfloop transitions, 207 changer transitions 12/1342 dead transitions. [2022-12-06 07:25:46,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1342 transitions, 29237 flow [2022-12-06 07:25:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:25:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:25:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 07:25:46,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2157258064516129 [2022-12-06 07:25:46,873 INFO L175 Difference]: Start difference. First operand has 183 places, 1015 transitions, 20666 flow. Second operand 8 states and 107 transitions. [2022-12-06 07:25:46,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1342 transitions, 29237 flow [2022-12-06 07:25:48,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 1342 transitions, 28780 flow, removed 145 selfloop flow, removed 2 redundant places. [2022-12-06 07:25:48,134 INFO L231 Difference]: Finished difference. Result has 191 places, 1130 transitions, 23817 flow [2022-12-06 07:25:48,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=20105, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1006, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=849, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=23817, PETRI_PLACES=191, PETRI_TRANSITIONS=1130} [2022-12-06 07:25:48,134 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 172 predicate places. [2022-12-06 07:25:48,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:25:48,135 INFO L89 Accepts]: Start accepts. Operand has 191 places, 1130 transitions, 23817 flow [2022-12-06 07:25:48,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:25:48,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:25:48,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 1130 transitions, 23817 flow [2022-12-06 07:25:48,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 1130 transitions, 23817 flow [2022-12-06 07:25:48,749 INFO L130 PetriNetUnfolder]: 1620/3677 cut-off events. [2022-12-06 07:25:48,749 INFO L131 PetriNetUnfolder]: For 84890/88122 co-relation queries the response was YES. [2022-12-06 07:25:48,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32764 conditions, 3677 events. 1620/3677 cut-off events. For 84890/88122 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 30751 event pairs, 29 based on Foata normal form. 2/3671 useless extension candidates. Maximal degree in co-relation 32598. Up to 1456 conditions per place. [2022-12-06 07:25:48,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 1130 transitions, 23817 flow [2022-12-06 07:25:48,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 2510 [2022-12-06 07:25:48,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:25:48,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 660 [2022-12-06 07:25:48,795 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 1130 transitions, 23817 flow [2022-12-06 07:25:48,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:48,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:25:48,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:25:48,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:25:48,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 07:25:48,997 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:25:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:25:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1903726404, now seen corresponding path program 1 times [2022-12-06 07:25:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:25:48,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000103419] [2022-12-06 07:25:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:25:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:25:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000103419] [2022-12-06 07:25:49,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000103419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:25:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340698119] [2022-12-06 07:25:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:25:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:25:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:25:49,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:25:49,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:25:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:25:49,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:25:49,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:25:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:25:50,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:25:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:25:51,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340698119] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:25:51,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:25:51,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-06 07:25:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005115993] [2022-12-06 07:25:51,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:25:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:25:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:25:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:25:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:25:51,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:25:51,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 1130 transitions, 23817 flow. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:25:51,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:25:51,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:25:51,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:25:54,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:25:57,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:26:03,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:26:07,505 INFO L130 PetriNetUnfolder]: 5434/9554 cut-off events. [2022-12-06 07:26:07,505 INFO L131 PetriNetUnfolder]: For 190432/190432 co-relation queries the response was YES. [2022-12-06 07:26:07,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87036 conditions, 9554 events. 5434/9554 cut-off events. For 190432/190432 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 70587 event pairs, 70 based on Foata normal form. 2/9532 useless extension candidates. Maximal degree in co-relation 86749. Up to 8261 conditions per place. [2022-12-06 07:26:07,586 INFO L137 encePairwiseOnDemand]: 10/61 looper letters, 1074 selfloop transitions, 307 changer transitions 22/1403 dead transitions. [2022-12-06 07:26:07,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 1403 transitions, 31578 flow [2022-12-06 07:26:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 07:26:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 07:26:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 199 transitions. [2022-12-06 07:26:07,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14183891660727013 [2022-12-06 07:26:07,594 INFO L175 Difference]: Start difference. First operand has 191 places, 1130 transitions, 23817 flow. Second operand 23 states and 199 transitions. [2022-12-06 07:26:07,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 1403 transitions, 31578 flow [2022-12-06 07:26:09,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1403 transitions, 30647 flow, removed 379 selfloop flow, removed 4 redundant places. [2022-12-06 07:26:09,285 INFO L231 Difference]: Finished difference. Result has 218 places, 1294 transitions, 27915 flow [2022-12-06 07:26:09,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=23065, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=27915, PETRI_PLACES=218, PETRI_TRANSITIONS=1294} [2022-12-06 07:26:09,286 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 199 predicate places. [2022-12-06 07:26:09,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:09,287 INFO L89 Accepts]: Start accepts. Operand has 218 places, 1294 transitions, 27915 flow [2022-12-06 07:26:09,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:09,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:09,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 1294 transitions, 27915 flow [2022-12-06 07:26:09,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 1294 transitions, 27915 flow [2022-12-06 07:26:10,065 INFO L130 PetriNetUnfolder]: 1793/4156 cut-off events. [2022-12-06 07:26:10,065 INFO L131 PetriNetUnfolder]: For 98956/101143 co-relation queries the response was YES. [2022-12-06 07:26:10,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37931 conditions, 4156 events. 1793/4156 cut-off events. For 98956/101143 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 36185 event pairs, 28 based on Foata normal form. 5/4153 useless extension candidates. Maximal degree in co-relation 37753. Up to 1667 conditions per place. [2022-12-06 07:26:10,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 1294 transitions, 27915 flow [2022-12-06 07:26:10,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 2876 [2022-12-06 07:26:10,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] L40-1-->L41-6: Formula: (and (< v_~i1~0_246 v_~n~0_171) (= 2 v_~j1~0_263) (= v_~k2~0_235 (+ v_~k2~0_236 v_~m~0_185)) (= (+ v_~i2~0_236 1) v_~i2~0_235) (<= v_~m~0_185 3) (< 2 v_~m~0_185) (= (+ v_~i1~0_247 1) v_~i1~0_246) (= v_~k1~0_246 (+ v_~k1~0_248 5)) (< v_~i2~0_236 v_~n~0_171)) InVars {~m~0=v_~m~0_185, ~k1~0=v_~k1~0_248, ~k2~0=v_~k2~0_236, ~i2~0=v_~i2~0_236, ~i1~0=v_~i1~0_247, ~n~0=v_~n~0_171} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_118|, ~m~0=v_~m~0_185, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_122|, ~k1~0=v_~k1~0_246, ~k2~0=v_~k2~0_235, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_124|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_101|, ~j1~0=v_~j1~0_263, ~i2~0=v_~i2~0_235, ~i1~0=v_~i1~0_246, ~n~0=v_~n~0_171} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post1, ~k1~0, ~k2~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i2~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] L40-1-->L41-6: Formula: (and (< v_~i1~0_261 v_~n~0_181) (< 7 v_~m~0_195) (= v_~k1~0_262 (+ v_~k1~0_264 8)) (= 8 v_~j1~0_278)) InVars {~m~0=v_~m~0_195, ~k1~0=v_~k1~0_264, ~i1~0=v_~i1~0_261, ~n~0=v_~n~0_181} OutVars{~m~0=v_~m~0_195, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_132|, ~k1~0=v_~k1~0_262, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_134|, ~j1~0=v_~j1~0_278, ~i1~0=v_~i1~0_261, ~n~0=v_~n~0_181} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L40-1-->L41-6: Formula: (and (= v_~k1~0_290 (+ v_~k1~0_292 9)) (= 9 v_~j1~0_320) (< 8 v_~m~0_215) (< v_~i1~0_303 v_~n~0_201)) InVars {~m~0=v_~m~0_215, ~k1~0=v_~k1~0_292, ~i1~0=v_~i1~0_303, ~n~0=v_~n~0_201} OutVars{~m~0=v_~m~0_215, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_152|, ~k1~0=v_~k1~0_290, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_154|, ~j1~0=v_~j1~0_320, ~i1~0=v_~i1~0_303, ~n~0=v_~n~0_201} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:10,945 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:26:10,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1659 [2022-12-06 07:26:10,946 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 1294 transitions, 28099 flow [2022-12-06 07:26:10,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:10,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:10,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:10,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 07:26:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:11,147 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 942478209, now seen corresponding path program 1 times [2022-12-06 07:26:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:11,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415069786] [2022-12-06 07:26:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415069786] [2022-12-06 07:26:11,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415069786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:11,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554689979] [2022-12-06 07:26:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:11,410 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:11,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:26:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:11,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 07:26:11,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:11,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:26:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554689979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:26:11,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:26:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:26:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40758557] [2022-12-06 07:26:11,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:26:11,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:26:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:26:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:26:11,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 07:26:11,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 1294 transitions, 28099 flow. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:11,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:11,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 07:26:11,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:17,801 INFO L130 PetriNetUnfolder]: 5631/9907 cut-off events. [2022-12-06 07:26:17,801 INFO L131 PetriNetUnfolder]: For 203736/203736 co-relation queries the response was YES. [2022-12-06 07:26:17,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92491 conditions, 9907 events. 5631/9907 cut-off events. For 203736/203736 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 73654 event pairs, 56 based on Foata normal form. 2/9885 useless extension candidates. Maximal degree in co-relation 92230. Up to 6602 conditions per place. [2022-12-06 07:26:17,883 INFO L137 encePairwiseOnDemand]: 10/75 looper letters, 697 selfloop transitions, 733 changer transitions 25/1455 dead transitions. [2022-12-06 07:26:17,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1455 transitions, 33913 flow [2022-12-06 07:26:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:26:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:26:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2022-12-06 07:26:17,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13254901960784313 [2022-12-06 07:26:17,885 INFO L175 Difference]: Start difference. First operand has 218 places, 1294 transitions, 28099 flow. Second operand 17 states and 169 transitions. [2022-12-06 07:26:17,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1455 transitions, 33913 flow [2022-12-06 07:26:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1455 transitions, 33032 flow, removed 406 selfloop flow, removed 4 redundant places. [2022-12-06 07:26:20,067 INFO L231 Difference]: Finished difference. Result has 237 places, 1398 transitions, 32589 flow [2022-12-06 07:26:20,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=27242, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=639, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=32589, PETRI_PLACES=237, PETRI_TRANSITIONS=1398} [2022-12-06 07:26:20,068 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 218 predicate places. [2022-12-06 07:26:20,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:20,068 INFO L89 Accepts]: Start accepts. Operand has 237 places, 1398 transitions, 32589 flow [2022-12-06 07:26:20,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:20,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:20,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 1398 transitions, 32589 flow [2022-12-06 07:26:20,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 1398 transitions, 32589 flow [2022-12-06 07:26:21,116 INFO L130 PetriNetUnfolder]: 1852/4289 cut-off events. [2022-12-06 07:26:21,116 INFO L131 PetriNetUnfolder]: For 111653/113252 co-relation queries the response was YES. [2022-12-06 07:26:21,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41665 conditions, 4289 events. 1852/4289 cut-off events. For 111653/113252 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 37371 event pairs, 24 based on Foata normal form. 10/4290 useless extension candidates. Maximal degree in co-relation 41498. Up to 1724 conditions per place. [2022-12-06 07:26:21,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 1398 transitions, 32589 flow [2022-12-06 07:26:21,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 3112 [2022-12-06 07:26:21,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:21,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L40-1-->L41-6: Formula: (and (< v_~i1~0_8 v_~n~0_7) (= v_~j1~0_8 0)) InVars {~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} OutVars{~j1~0=v_~j1~0_8, ~i1~0=v_~i1~0_8, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:21,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] L40-1-->L51-1: Formula: (and (< v_~i1~0_301 v_~n~0_199) (< v_~i2~0_275 v_~n~0_199) (= v_~k1~0_286 (+ v_~k1~0_287 8)) (< 7 v_~m~0_213) (= v_~k2~0_271 (+ v_~k2~0_272 v_~m~0_213)) (= 8 v_~j1~0_318) (= v_~i2~0_274 (+ v_~i2~0_275 1))) InVars {~m~0=v_~m~0_213, ~k2~0=v_~k2~0_272, ~k1~0=v_~k1~0_287, ~i2~0=v_~i2~0_275, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_141|, ~m~0=v_~m~0_213, ~k2~0=v_~k2~0_271, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_150|, ~k1~0=v_~k1~0_286, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_152|, ~i2~0=v_~i2~0_274, ~j1~0=v_~j1~0_318, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [388] L41-6-->L40-1: Formula: (and (= (+ v_~i1~0_In_3 1) v_~i1~0_Out_14) (not (< v_~j1~0_In_3 v_~m~0_In_2))) InVars {~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_In_3} OutVars{~j1~0=v_~j1~0_In_3, ~m~0=v_~m~0_In_2, ~i1~0=v_~i1~0_Out_14, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_Out_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~i1~0] [2022-12-06 07:26:21,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] L40-1-->L51-1: Formula: (and (< v_~i1~0_301 v_~n~0_199) (< v_~i2~0_275 v_~n~0_199) (= v_~k1~0_286 (+ v_~k1~0_287 8)) (< 7 v_~m~0_213) (= v_~k2~0_271 (+ v_~k2~0_272 v_~m~0_213)) (= 8 v_~j1~0_318) (= v_~i2~0_274 (+ v_~i2~0_275 1))) InVars {~m~0=v_~m~0_213, ~k2~0=v_~k2~0_272, ~k1~0=v_~k1~0_287, ~i2~0=v_~i2~0_275, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_141|, ~m~0=v_~m~0_213, ~k2~0=v_~k2~0_271, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_150|, ~k1~0=v_~k1~0_286, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_152|, ~i2~0=v_~i2~0_274, ~j1~0=v_~j1~0_318, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [484] L41-6-->L41-6: Formula: (and (< v_~i1~0_326 v_~n~0_221) (= v_~i1~0_326 (+ v_~i1~0_327 1)) (not (< v_~j1~0_362 v_~m~0_237)) (= v_~j1~0_361 0)) InVars {~m~0=v_~m~0_237, ~j1~0=v_~j1~0_362, ~i1~0=v_~i1~0_327, ~n~0=v_~n~0_221} OutVars{~m~0=v_~m~0_237, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_136|, ~j1~0=v_~j1~0_361, ~i1~0=v_~i1~0_326, ~n~0=v_~n~0_221} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] [2022-12-06 07:26:21,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] L40-1-->L51-1: Formula: (and (< v_~i1~0_301 v_~n~0_199) (< v_~i2~0_275 v_~n~0_199) (= v_~k1~0_286 (+ v_~k1~0_287 8)) (< 7 v_~m~0_213) (= v_~k2~0_271 (+ v_~k2~0_272 v_~m~0_213)) (= 8 v_~j1~0_318) (= v_~i2~0_274 (+ v_~i2~0_275 1))) InVars {~m~0=v_~m~0_213, ~k2~0=v_~k2~0_272, ~k1~0=v_~k1~0_287, ~i2~0=v_~i2~0_275, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_141|, ~m~0=v_~m~0_213, ~k2~0=v_~k2~0_271, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_150|, ~k1~0=v_~k1~0_286, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_152|, ~i2~0=v_~i2~0_274, ~j1~0=v_~j1~0_318, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [485] L41-6-->L51-1: Formula: (and (= (+ v_~i2~0_300 1) v_~i2~0_299) (= v_~k2~0_297 (+ v_~k2~0_298 v_~m~0_239)) (not (< v_~j1~0_365 v_~m~0_239)) (= v_~i1~0_330 (+ v_~i1~0_331 1)) (< v_~i2~0_300 v_~n~0_223)) InVars {~m~0=v_~m~0_239, ~k2~0=v_~k2~0_298, ~i2~0=v_~i2~0_300, ~j1~0=v_~j1~0_365, ~i1~0=v_~i1~0_331, ~n~0=v_~n~0_223} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_155|, ~m~0=v_~m~0_239, ~k2~0=v_~k2~0_297, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_138|, ~i2~0=v_~i2~0_299, ~j1~0=v_~j1~0_365, ~i1~0=v_~i1~0_330, ~n~0=v_~n~0_223} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post3, ~i2~0, ~i1~0] [2022-12-06 07:26:21,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] L40-1-->L51-1: Formula: (and (< v_~i1~0_301 v_~n~0_199) (< v_~i2~0_275 v_~n~0_199) (= v_~k1~0_286 (+ v_~k1~0_287 8)) (< 7 v_~m~0_213) (= v_~k2~0_271 (+ v_~k2~0_272 v_~m~0_213)) (= 8 v_~j1~0_318) (= v_~i2~0_274 (+ v_~i2~0_275 1))) InVars {~m~0=v_~m~0_213, ~k2~0=v_~k2~0_272, ~k1~0=v_~k1~0_287, ~i2~0=v_~i2~0_275, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_141|, ~m~0=v_~m~0_213, ~k2~0=v_~k2~0_271, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_150|, ~k1~0=v_~k1~0_286, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_152|, ~i2~0=v_~i2~0_274, ~j1~0=v_~j1~0_318, ~i1~0=v_~i1~0_301, ~n~0=v_~n~0_199} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~i2~0, ~j1~0] and [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] [2022-12-06 07:26:21,893 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:26:21,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1828 [2022-12-06 07:26:21,896 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1398 transitions, 32734 flow [2022-12-06 07:26:21,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:21,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:26:21,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:26:21,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:26:22,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:22,107 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:26:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:26:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash -998295741, now seen corresponding path program 1 times [2022-12-06 07:26:22,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:26:22,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401584550] [2022-12-06 07:26:22,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:26:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:26:22,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401584550] [2022-12-06 07:26:22,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401584550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:26:22,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381246100] [2022-12-06 07:26:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:26:22,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:26:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:26:22,463 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:26:22,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:26:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:26:22,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:26:22,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:26:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:26:22,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:26:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:26:23,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381246100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:26:23,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:26:23,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-06 07:26:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870619070] [2022-12-06 07:26:23,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:26:23,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:26:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:26:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:26:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:26:23,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 07:26:23,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1398 transitions, 32734 flow. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:26:23,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:26:23,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 07:26:23,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:26:27,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:26:31,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:26:34,833 INFO L130 PetriNetUnfolder]: 6465/11425 cut-off events. [2022-12-06 07:26:34,833 INFO L131 PetriNetUnfolder]: For 269852/269852 co-relation queries the response was YES. [2022-12-06 07:26:34,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113728 conditions, 11425 events. 6465/11425 cut-off events. For 269852/269852 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 86789 event pairs, 42 based on Foata normal form. 2/11397 useless extension candidates. Maximal degree in co-relation 113459. Up to 6585 conditions per place. [2022-12-06 07:26:34,943 INFO L137 encePairwiseOnDemand]: 10/81 looper letters, 710 selfloop transitions, 1017 changer transitions 21/1748 dead transitions. [2022-12-06 07:26:34,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1748 transitions, 43966 flow [2022-12-06 07:26:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:26:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:26:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 197 transitions. [2022-12-06 07:26:34,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12160493827160494 [2022-12-06 07:26:34,945 INFO L175 Difference]: Start difference. First operand has 231 places, 1398 transitions, 32734 flow. Second operand 20 states and 197 transitions. [2022-12-06 07:26:34,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1748 transitions, 43966 flow [2022-12-06 07:26:37,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1748 transitions, 43227 flow, removed 283 selfloop flow, removed 5 redundant places. [2022-12-06 07:26:37,901 INFO L231 Difference]: Finished difference. Result has 253 places, 1672 transitions, 43225 flow [2022-12-06 07:26:37,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=32026, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=770, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=43225, PETRI_PLACES=253, PETRI_TRANSITIONS=1672} [2022-12-06 07:26:37,902 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 234 predicate places. [2022-12-06 07:26:37,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:26:37,903 INFO L89 Accepts]: Start accepts. Operand has 253 places, 1672 transitions, 43225 flow [2022-12-06 07:26:37,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:26:37,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:26:37,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 1672 transitions, 43225 flow [2022-12-06 07:26:37,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 1672 transitions, 43225 flow [2022-12-06 07:26:39,215 INFO L130 PetriNetUnfolder]: 2133/4991 cut-off events. [2022-12-06 07:26:39,215 INFO L131 PetriNetUnfolder]: For 156011/160229 co-relation queries the response was YES. [2022-12-06 07:26:39,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52912 conditions, 4991 events. 2133/4991 cut-off events. For 156011/160229 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 44723 event pairs, 18 based on Foata normal form. 6/4987 useless extension candidates. Maximal degree in co-relation 52737. Up to 2088 conditions per place. [2022-12-06 07:26:39,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 1672 transitions, 43225 flow [2022-12-06 07:26:39,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 3672 [2022-12-06 07:26:39,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L40-1-->L41-6: Formula: (and (= v_~k1~0_310 (+ v_~k1~0_312 10)) (= v_~j1~0_346 10) (< v_~i1~0_317 v_~n~0_213) (< v_~j1~0_346 (+ v_~m~0_229 1))) InVars {~m~0=v_~m~0_229, ~k1~0=v_~k1~0_312, ~i1~0=v_~i1~0_317, ~n~0=v_~n~0_213} OutVars{~m~0=v_~m~0_229, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_164|, ~k1~0=v_~k1~0_310, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_166|, ~j1~0=v_~j1~0_346, ~i1~0=v_~i1~0_317, ~n~0=v_~n~0_213} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:39,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:39,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [494] L40-1-->L40-1: Formula: (and (= v_~j1~0_394 10) (not (< v_~j1~0_394 v_~m~0_257)) (< v_~i1~0_358 v_~n~0_241) (= v_~k1~0_364 (+ v_~k1~0_365 10)) (= (+ v_~i1~0_358 1) v_~i1~0_357) (< v_~j1~0_394 (+ v_~m~0_257 1))) InVars {~m~0=v_~m~0_257, ~k1~0=v_~k1~0_365, ~i1~0=v_~i1~0_358, ~n~0=v_~n~0_241} OutVars{~m~0=v_~m~0_257, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_196|, ~k1~0=v_~k1~0_364, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_198|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_148|, ~j1~0=v_~j1~0_394, ~i1~0=v_~i1~0_357, ~n~0=v_~n~0_241} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:39,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] L41-6-->L40-1: Formula: (and (= v_~j1~0_408 (+ v_~j1~0_409 1)) (= v_~k1~0_382 (+ v_~k1~0_383 1)) (not (< v_~j1~0_408 v_~m~0_265)) (= v_~i1~0_363 (+ v_~i1~0_364 1)) (< v_~j1~0_409 v_~m~0_265)) InVars {~m~0=v_~m~0_265, ~k1~0=v_~k1~0_383, ~j1~0=v_~j1~0_409, ~i1~0=v_~i1~0_364} OutVars{~m~0=v_~m~0_265, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_206|, ~k1~0=v_~k1~0_382, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_208|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_150|, ~j1~0=v_~j1~0_408, ~i1~0=v_~i1~0_363} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, ~j1~0, ~i1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:39,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L41-6-->L41-6: Formula: (and (< v_~j1~0_31 v_~m~0_21) (= (+ v_~j1~0_31 1) v_~j1~0_30) (= (+ v_~k1~0_38 1) v_~k1~0_37)) InVars {~m~0=v_~m~0_21, ~k1~0=v_~k1~0_38, ~j1~0=v_~j1~0_31} OutVars{~m~0=v_~m~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, ~k1~0=v_~k1~0_37, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, ~j1~0=v_~j1~0_30} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~k1~0, thread1Thread1of1ForFork0_#t~post2, ~j1~0] and [384] L51-1-->L51-1: Formula: (and (= v_~k2~0_59 (+ v_~m~0_57 v_~k2~0_60)) (= (+ v_~i2~0_57 1) v_~i2~0_56) (< v_~i2~0_57 v_~n~0_47)) InVars {~m~0=v_~m~0_57, ~k2~0=v_~k2~0_60, ~i2~0=v_~i2~0_57, ~n~0=v_~n~0_47} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_15|, ~m~0=v_~m~0_57, ~k2~0=v_~k2~0_59, ~i2~0=v_~i2~0_56, ~n~0=v_~n~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~k2~0, ~i2~0] [2022-12-06 07:26:40,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 07:26:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-06 07:26:40,284 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 15 out of bounds for length 15 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:26:40,286 INFO L158 Benchmark]: Toolchain (without parser) took 112232.97ms. Allocated memory was 197.1MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 174.9MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 739.3MB. Max. memory is 8.0GB. [2022-12-06 07:26:40,286 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:26:40,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.72ms. Allocated memory is still 197.1MB. Free memory was 174.4MB in the beginning and 163.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 07:26:40,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.22ms. Allocated memory is still 197.1MB. Free memory was 163.9MB in the beginning and 161.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:26:40,287 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 197.1MB. Free memory was 161.9MB in the beginning and 160.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:26:40,287 INFO L158 Benchmark]: RCFGBuilder took 341.60ms. Allocated memory is still 197.1MB. Free memory was 160.8MB in the beginning and 147.3MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:26:40,287 INFO L158 Benchmark]: TraceAbstraction took 111598.75ms. Allocated memory was 197.1MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 146.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 710.9MB. Max. memory is 8.0GB. [2022-12-06 07:26:40,288 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.72ms. Allocated memory is still 197.1MB. Free memory was 174.4MB in the beginning and 163.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.22ms. Allocated memory is still 197.1MB. Free memory was 163.9MB in the beginning and 161.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 197.1MB. Free memory was 161.9MB in the beginning and 160.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 341.60ms. Allocated memory is still 197.1MB. Free memory was 160.8MB in the beginning and 147.3MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 111598.75ms. Allocated memory was 197.1MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 146.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 710.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 100 PlacesBefore, 19 PlacesAfterwards, 102 TransitionsBefore, 15 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 25 ConcurrentYvCompositions, 6 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 395, independent: 395, independent conditional: 395, 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: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 395, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 395, unknown conditional: 0, unknown unconditional: 395] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 669, Positive conditional cache size: 0, Positive unconditional cache size: 669, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 18 PlacesBefore, 18 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.1s, 24 PlacesBefore, 24 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, 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: 8, independent: 8, independent conditional: 2, 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: 8, independent: 8, independent conditional: 2, 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: 8, independent: 8, independent conditional: 2, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 66 PlacesBefore, 64 PlacesAfterwards, 109 TransitionsBefore, 107 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 17, Positive conditional cache size: 11, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 82 PlacesBefore, 81 PlacesAfterwards, 259 TransitionsBefore, 258 TransitionsAfterwards, 658 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, 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: 10, independent unconditional: 2, 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: 4, independent unconditional: 2, 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: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 16, Positive unconditional cache size: 8, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 266 TransitionsBefore, 266 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 16, Positive unconditional cache size: 8, 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: 1.1s, 111 PlacesBefore, 110 PlacesAfterwards, 332 TransitionsBefore, 331 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 28, independent unconditional: 9, 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: 37, independent: 37, independent conditional: 28, independent unconditional: 9, 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: 15, independent: 15, independent conditional: 12, 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: 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] , 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: 37, independent: 22, independent conditional: 16, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 12, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 37, Positive unconditional cache size: 16, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 125 PlacesBefore, 125 PlacesAfterwards, 616 TransitionsBefore, 616 TransitionsAfterwards, 1396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 45, Positive unconditional cache size: 16, 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, 125 PlacesBefore, 125 PlacesAfterwards, 598 TransitionsBefore, 598 TransitionsAfterwards, 1356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 45, Positive unconditional cache size: 16, 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: 1.2s, 143 PlacesBefore, 142 PlacesAfterwards, 637 TransitionsBefore, 636 TransitionsAfterwards, 1458 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 25, 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: 31, independent: 31, independent conditional: 25, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 23, independent conditional: 17, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 82, Positive conditional cache size: 63, Positive unconditional cache size: 19, 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: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 155 PlacesBefore, 153 PlacesAfterwards, 779 TransitionsBefore, 777 TransitionsAfterwards, 1748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 3, independent unconditional: 9, 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: 3, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 64, Positive unconditional cache size: 21, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 175 PlacesBefore, 175 PlacesAfterwards, 853 TransitionsBefore, 853 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 68, Positive unconditional cache size: 23, 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, 174 PlacesBefore, 174 PlacesAfterwards, 1005 TransitionsBefore, 1005 TransitionsAfterwards, 2220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 68, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 176 PlacesBefore, 176 PlacesAfterwards, 1008 TransitionsBefore, 1008 TransitionsAfterwards, 2230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 68, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 183 PlacesBefore, 183 PlacesAfterwards, 1015 TransitionsBefore, 1015 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 68, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 191 PlacesBefore, 191 PlacesAfterwards, 1130 TransitionsBefore, 1130 TransitionsAfterwards, 2510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 91, Positive conditional cache size: 68, Positive unconditional cache size: 23, 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, 218 PlacesBefore, 218 PlacesAfterwards, 1294 TransitionsBefore, 1294 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 18, 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: 30, independent: 30, independent conditional: 18, 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 115, Positive conditional cache size: 88, Positive unconditional cache size: 27, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 231 PlacesBefore, 231 PlacesAfterwards, 1398 TransitionsBefore, 1398 TransitionsAfterwards, 3112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 8, 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: 14, independent: 14, independent conditional: 8, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 119, Positive conditional cache size: 90, 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: 6, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 15 out of bounds for length 15 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 15 out of bounds for length 15: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:26:40,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...