/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-RepeatedSemanticLbe.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-05 23:59:19,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:59:19,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:59:19,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:59:19,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:59:19,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:59:19,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:59:19,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:59:19,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:59:19,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:59:19,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:59:19,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:59:19,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:59:19,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:59:19,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:59:19,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:59:19,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:59:19,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:59:19,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:59:19,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:59:19,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:59:19,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:59:19,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:59:19,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:59:19,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:59:19,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:59:19,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:59:19,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:59:19,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:59:19,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:59:19,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:59:19,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:59:19,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:59:19,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:59:19,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:59:19,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:59:19,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:59:19,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:59:19,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:59:19,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:59:19,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:59:19,287 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-RepeatedSemanticLbe.epf [2022-12-05 23:59:19,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:59:19,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:59:19,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:59:19,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:59:19,314 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:59:19,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:59:19,314 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:59:19,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:59:19,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:59:19,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:59:19,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:59:19,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:59:19,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:59:19,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:59:19,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:59:19,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:59:19,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:59:19,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:59:19,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:59:19,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:59:19,317 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-05 23:59:19,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:59:19,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:59:19,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:59:19,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:59:19,607 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:59:19,608 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-05 23:59:20,576 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:59:20,809 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:59:20,809 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-05 23:59:20,823 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ee44ff0/ed311cf752ae413e94552a3c3276147d/FLAGb7b36615a [2022-12-05 23:59:20,838 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59ee44ff0/ed311cf752ae413e94552a3c3276147d [2022-12-05 23:59:20,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:59:20,844 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:59:20,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:59:20,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:59:20,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:59:20,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:59:20" (1/1) ... [2022-12-05 23:59:20,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6694e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:20, skipping insertion in model container [2022-12-05 23:59:20,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:59:20" (1/1) ... [2022-12-05 23:59:20,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:59:20,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:59:20,959 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-05 23:59:20,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:59:20,974 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:59:20,993 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-05 23:59:20,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:59:21,002 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:59:21,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21 WrapperNode [2022-12-05 23:59:21,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:59:21,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:59:21,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:59:21,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:59:21,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,032 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2022-12-05 23:59:21,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:59:21,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:59:21,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:59:21,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:59:21,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:59:21,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:59:21,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:59:21,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:59:21,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (1/1) ... [2022-12-05 23:59:21,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:59:21,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:21,107 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-05 23:59:21,113 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-05 23:59:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:59:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 23:59:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 23:59:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:59:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:59:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:59:21,137 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:59:21,228 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:59:21,230 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:59:21,426 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:59:21,436 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:59:21,437 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 23:59:21,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:59:21 BoogieIcfgContainer [2022-12-05 23:59:21,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:59:21,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:59:21,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:59:21,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:59:21,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:59:20" (1/3) ... [2022-12-05 23:59:21,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c64351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:59:21, skipping insertion in model container [2022-12-05 23:59:21,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:59:21" (2/3) ... [2022-12-05 23:59:21,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c64351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:59:21, skipping insertion in model container [2022-12-05 23:59:21,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:59:21" (3/3) ... [2022-12-05 23:59:21,443 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2022-12-05 23:59:21,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:59:21,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:59:21,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:59:21,506 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 23:59:21,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 240 flow [2022-12-05 23:59:21,594 INFO L130 PetriNetUnfolder]: 9/110 cut-off events. [2022-12-05 23:59:21,595 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:21,598 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-05 23:59:21,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 112 transitions, 240 flow [2022-12-05 23:59:21,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 216 flow [2022-12-05 23:59:21,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:21,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-05 23:59:21,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 102 transitions, 216 flow [2022-12-05 23:59:21,644 INFO L130 PetriNetUnfolder]: 9/102 cut-off events. [2022-12-05 23:59:21,644 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:21,645 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-05 23:59:21,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 102 transitions, 216 flow [2022-12-05 23:59:21,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-05 23:59:25,141 INFO L203 LiptonReduction]: Total number of compositions: 87 [2022-12-05 23:59:25,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:59:25,157 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;@3f1fcc8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:59:25,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 23:59:25,166 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-05 23:59:25,166 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:59:25,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:25,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:25,167 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-05 23:59:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1941019273, now seen corresponding path program 1 times [2022-12-05 23:59:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:25,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734491945] [2022-12-05 23:59:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:25,471 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-05 23:59:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734491945] [2022-12-05 23:59:25,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734491945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:25,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:25,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:59:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19630791] [2022-12-05 23:59:25,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:59:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:25,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:59:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:59:25,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:59:25,491 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-05 23:59:25,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:25,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:59:25,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:25,542 INFO L130 PetriNetUnfolder]: 69/117 cut-off events. [2022-12-05 23:59:25,543 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:59:25,543 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-05 23:59:25,545 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-05 23:59:25,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 129 flow [2022-12-05 23:59:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:59:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:59:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-05 23:59:25,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2022-12-05 23:59:25,554 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 28 transitions. [2022-12-05 23:59:25,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 129 flow [2022-12-05 23:59:25,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:59:25,558 INFO L231 Difference]: Finished difference. Result has 18 places, 17 transitions, 53 flow [2022-12-05 23:59:25,559 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-05 23:59:25,564 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-05 23:59:25,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:25,564 INFO L89 Accepts]: Start accepts. Operand has 18 places, 17 transitions, 53 flow [2022-12-05 23:59:25,567 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:25,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:25,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-05 23:59:25,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 17 transitions, 53 flow [2022-12-05 23:59:25,575 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-05 23:59:25,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:59:25,576 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-05 23:59:25,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 17 transitions, 53 flow [2022-12-05 23:59:25,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-05 23:59:25,577 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:25,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-05 23:59:25,579 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 17 transitions, 53 flow [2022-12-05 23:59:25,579 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-05 23:59:25,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:25,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:25,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:59:25,582 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-05 23:59:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1677528037, now seen corresponding path program 1 times [2022-12-05 23:59:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242894042] [2022-12-05 23:59:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:25,681 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-05 23:59:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242894042] [2022-12-05 23:59:25,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242894042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:25,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:25,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:59:25,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116313435] [2022-12-05 23:59:25,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:25,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:25,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:59:25,685 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-05 23:59:25,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:25,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:59:25,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:25,770 INFO L130 PetriNetUnfolder]: 125/216 cut-off events. [2022-12-05 23:59:25,771 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-05 23:59:25,774 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-05 23:59:25,777 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 40 selfloop transitions, 7 changer transitions 2/49 dead transitions. [2022-12-05 23:59:25,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 49 transitions, 242 flow [2022-12-05 23:59:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:59:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:59:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-05 23:59:25,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-05 23:59:25,779 INFO L175 Difference]: Start difference. First operand has 18 places, 17 transitions, 53 flow. Second operand 5 states and 44 transitions. [2022-12-05 23:59:25,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 49 transitions, 242 flow [2022-12-05 23:59:25,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:59:25,781 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 101 flow [2022-12-05 23:59:25,781 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-05 23:59:25,782 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-05 23:59:25,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:25,782 INFO L89 Accepts]: Start accepts. Operand has 24 places, 23 transitions, 101 flow [2022-12-05 23:59:25,783 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:25,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:25,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-05 23:59:25,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 101 flow [2022-12-05 23:59:25,789 INFO L130 PetriNetUnfolder]: 29/79 cut-off events. [2022-12-05 23:59:25,789 INFO L131 PetriNetUnfolder]: For 23/36 co-relation queries the response was YES. [2022-12-05 23:59:25,790 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-05 23:59:25,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 23 transitions, 101 flow [2022-12-05 23:59:25,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:59:25,829 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-05 23:59:25,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:59:25,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-05 23:59:25,877 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 105 flow [2022-12-05 23:59:25,877 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-05 23:59:25,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:25,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:59:25,878 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-05 23:59:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1006824449, now seen corresponding path program 2 times [2022-12-05 23:59:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:25,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028170948] [2022-12-05 23:59:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:25,951 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-05 23:59:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:25,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028170948] [2022-12-05 23:59:25,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028170948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:25,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:25,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:59:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798796537] [2022-12-05 23:59:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:25,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:25,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:59:25,956 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-05 23:59:25,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:25,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:59:25,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:26,023 INFO L130 PetriNetUnfolder]: 111/192 cut-off events. [2022-12-05 23:59:26,023 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-05 23:59:26,024 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-05 23:59:26,024 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 32 selfloop transitions, 10 changer transitions 6/48 dead transitions. [2022-12-05 23:59:26,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 298 flow [2022-12-05 23:59:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:59:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:59:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-05 23:59:26,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-05 23:59:26,026 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 105 flow. Second operand 5 states and 40 transitions. [2022-12-05 23:59:26,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 298 flow [2022-12-05 23:59:26,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 48 transitions, 294 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 23:59:26,027 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 154 flow [2022-12-05 23:59:26,028 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-05 23:59:26,028 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2022-12-05 23:59:26,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:26,028 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 154 flow [2022-12-05 23:59:26,029 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:26,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:26,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-05 23:59:26,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 154 flow [2022-12-05 23:59:26,034 INFO L130 PetriNetUnfolder]: 31/74 cut-off events. [2022-12-05 23:59:26,034 INFO L131 PetriNetUnfolder]: For 69/77 co-relation queries the response was YES. [2022-12-05 23:59:26,034 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-05 23:59:26,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 154 flow [2022-12-05 23:59:26,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-05 23:59:26,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:26,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:59:26,036 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 154 flow [2022-12-05 23:59:26,036 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-05 23:59:26,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:26,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:26,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:59:26,036 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-05 23:59:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1476743439, now seen corresponding path program 1 times [2022-12-05 23:59:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:26,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216899265] [2022-12-05 23:59:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:26,070 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-05 23:59:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:26,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216899265] [2022-12-05 23:59:26,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216899265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:26,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:26,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:59:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033525665] [2022-12-05 23:59:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:26,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:26,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:59:26,071 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-05 23:59:26,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:26,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:59:26,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:26,126 INFO L130 PetriNetUnfolder]: 116/209 cut-off events. [2022-12-05 23:59:26,126 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-05 23:59:26,129 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-05 23:59:26,134 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 37 selfloop transitions, 6 changer transitions 6/49 dead transitions. [2022-12-05 23:59:26,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 362 flow [2022-12-05 23:59:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:59:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:59:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-05 23:59:26,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-05 23:59:26,136 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 154 flow. Second operand 5 states and 40 transitions. [2022-12-05 23:59:26,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 362 flow [2022-12-05 23:59:26,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 354 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-05 23:59:26,141 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 206 flow [2022-12-05 23:59:26,141 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-05 23:59:26,142 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 19 predicate places. [2022-12-05 23:59:26,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:26,142 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 206 flow [2022-12-05 23:59:26,144 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:26,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:26,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-05 23:59:26,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 206 flow [2022-12-05 23:59:26,151 INFO L130 PetriNetUnfolder]: 21/65 cut-off events. [2022-12-05 23:59:26,151 INFO L131 PetriNetUnfolder]: For 117/120 co-relation queries the response was YES. [2022-12-05 23:59:26,151 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-05 23:59:26,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 206 flow [2022-12-05 23:59:26,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-05 23:59:26,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:26,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:59:26,153 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 206 flow [2022-12-05 23:59:26,153 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-05 23:59:26,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:26,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:26,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:59:26,153 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-05 23:59:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -617492605, now seen corresponding path program 2 times [2022-12-05 23:59:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:26,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820212274] [2022-12-05 23:59:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:26,199 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-05 23:59:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820212274] [2022-12-05 23:59:26,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820212274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:26,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:59:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944476059] [2022-12-05 23:59:26,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:26,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:26,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:59:26,203 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-05 23:59:26,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:26,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:59:26,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:26,249 INFO L130 PetriNetUnfolder]: 88/150 cut-off events. [2022-12-05 23:59:26,249 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2022-12-05 23:59:26,250 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-05 23:59:26,251 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 30 selfloop transitions, 5 changer transitions 5/40 dead transitions. [2022-12-05 23:59:26,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 327 flow [2022-12-05 23:59:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:59:26,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-05 23:59:26,252 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 206 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:59:26,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 327 flow [2022-12-05 23:59:26,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 325 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 23:59:26,255 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 194 flow [2022-12-05 23:59:26,255 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-05 23:59:26,257 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2022-12-05 23:59:26,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:26,257 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 194 flow [2022-12-05 23:59:26,258 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:26,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:26,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 194 flow [2022-12-05 23:59:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 194 flow [2022-12-05 23:59:26,262 INFO L130 PetriNetUnfolder]: 21/48 cut-off events. [2022-12-05 23:59:26,262 INFO L131 PetriNetUnfolder]: For 107/110 co-relation queries the response was YES. [2022-12-05 23:59:26,262 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-05 23:59:26,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 194 flow [2022-12-05 23:59:26,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:59:26,263 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:26,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:59:26,266 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 194 flow [2022-12-05 23:59:26,266 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-05 23:59:26,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:26,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:26,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:59:26,266 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-05 23:59:26,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1669050343, now seen corresponding path program 1 times [2022-12-05 23:59:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:26,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506913407] [2022-12-05 23:59:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:26,550 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-05 23:59:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:26,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506913407] [2022-12-05 23:59:26,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506913407] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:26,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184416372] [2022-12-05 23:59:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:26,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:26,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:26,554 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-05 23:59:26,568 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-05 23:59:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:26,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 23:59:26,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:31,097 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-05 23:59:31,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:59:31,215 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-05 23:59:31,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184416372] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:59:31,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:59:31,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-05 23:59:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494484296] [2022-12-05 23:59:31,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:59:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 23:59:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 23:59:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=109, Unknown=2, NotChecked=0, Total=156 [2022-12-05 23:59:31,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:59:31,217 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-05 23:59:31,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:31,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:59:31,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:32,213 INFO L130 PetriNetUnfolder]: 382/661 cut-off events. [2022-12-05 23:59:32,213 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-12-05 23:59:32,215 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-05 23:59:32,217 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 102 selfloop transitions, 69 changer transitions 49/220 dead transitions. [2022-12-05 23:59:32,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 220 transitions, 1850 flow [2022-12-05 23:59:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 23:59:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 23:59:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 188 transitions. [2022-12-05 23:59:32,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5820433436532507 [2022-12-05 23:59:32,219 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 194 flow. Second operand 19 states and 188 transitions. [2022-12-05 23:59:32,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 220 transitions, 1850 flow [2022-12-05 23:59:32,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 220 transitions, 1787 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-05 23:59:32,224 INFO L231 Difference]: Finished difference. Result has 66 places, 109 transitions, 1156 flow [2022-12-05 23:59:32,224 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-05 23:59:32,225 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 47 predicate places. [2022-12-05 23:59:32,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:32,225 INFO L89 Accepts]: Start accepts. Operand has 66 places, 109 transitions, 1156 flow [2022-12-05 23:59:32,226 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:32,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:32,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-05 23:59:32,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 109 transitions, 1156 flow [2022-12-05 23:59:32,241 INFO L130 PetriNetUnfolder]: 111/253 cut-off events. [2022-12-05 23:59:32,242 INFO L131 PetriNetUnfolder]: For 922/927 co-relation queries the response was YES. [2022-12-05 23:59:32,242 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-05 23:59:32,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 109 transitions, 1156 flow [2022-12-05 23:59:32,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-05 23:59:32,318 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-05 23:59:32,404 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-05 23:59:32,654 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-05 23:59:32,707 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-05 23:59:32,782 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-05 23:59:32,830 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-05 23:59:32,983 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:59:32,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 759 [2022-12-05 23:59:32,984 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 107 transitions, 1216 flow [2022-12-05 23:59:32,984 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-05 23:59:32,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:32,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:33,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 23:59:33,185 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-05 23:59:33,185 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-05 23:59:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1093522903, now seen corresponding path program 2 times [2022-12-05 23:59:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:33,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95663869] [2022-12-05 23:59:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:33,437 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-05 23:59:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95663869] [2022-12-05 23:59:33,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95663869] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456099681] [2022-12-05 23:59:33,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 23:59:33,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:33,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:33,448 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-05 23:59:33,467 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-05 23:59:33,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 23:59:33,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 23:59:33,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 23:59:33,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:35,872 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-05 23:59:35,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:59:36,012 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-05 23:59:36,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456099681] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:59:36,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:59:36,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-05 23:59:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100945659] [2022-12-05 23:59:36,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:59:36,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 23:59:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 23:59:36,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=106, Unknown=1, NotChecked=0, Total=156 [2022-12-05 23:59:36,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:59:36,014 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-05 23:59:36,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:36,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:59:36,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:38,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-05 23:59:38,765 INFO L130 PetriNetUnfolder]: 977/1703 cut-off events. [2022-12-05 23:59:38,765 INFO L131 PetriNetUnfolder]: For 6556/6556 co-relation queries the response was YES. [2022-12-05 23:59:38,768 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-05 23:59:38,775 INFO L137 encePairwiseOnDemand]: 9/28 looper letters, 167 selfloop transitions, 181 changer transitions 30/378 dead transitions. [2022-12-05 23:59:38,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 378 transitions, 4575 flow [2022-12-05 23:59:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 23:59:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 23:59:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-12-05 23:59:38,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3826530612244898 [2022-12-05 23:59:38,777 INFO L175 Difference]: Start difference. First operand has 64 places, 107 transitions, 1216 flow. Second operand 14 states and 150 transitions. [2022-12-05 23:59:38,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 378 transitions, 4575 flow [2022-12-05 23:59:38,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 378 transitions, 4070 flow, removed 230 selfloop flow, removed 5 redundant places. [2022-12-05 23:59:38,803 INFO L231 Difference]: Finished difference. Result has 83 places, 259 transitions, 3282 flow [2022-12-05 23:59:38,803 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-05 23:59:38,803 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 64 predicate places. [2022-12-05 23:59:38,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:38,804 INFO L89 Accepts]: Start accepts. Operand has 83 places, 259 transitions, 3282 flow [2022-12-05 23:59:38,805 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:38,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:38,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 259 transitions, 3282 flow [2022-12-05 23:59:38,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 259 transitions, 3282 flow [2022-12-05 23:59:38,855 INFO L130 PetriNetUnfolder]: 297/689 cut-off events. [2022-12-05 23:59:38,855 INFO L131 PetriNetUnfolder]: For 4484/4551 co-relation queries the response was YES. [2022-12-05 23:59:38,856 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-05 23:59:38,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 259 transitions, 3282 flow [2022-12-05 23:59:38,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-05 23:59:38,929 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-05 23:59:39,041 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-05 23:59:39,110 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:59:39,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-05 23:59:39,110 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 258 transitions, 3300 flow [2022-12-05 23:59:39,110 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-05 23:59:39,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:39,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:39,133 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-05 23:59:39,311 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-05 23:59:39,311 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-05 23:59:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 20624319, now seen corresponding path program 1 times [2022-12-05 23:59:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:39,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962585336] [2022-12-05 23:59:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:39,587 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-05 23:59:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962585336] [2022-12-05 23:59:39,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962585336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119245557] [2022-12-05 23:59:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:39,589 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-05 23:59:39,607 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-05 23:59:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:39,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 23:59:39,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:39,849 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-05 23:59:39,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:59:40,032 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-05 23:59:40,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119245557] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:40,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 23:59:40,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 7 [2022-12-05 23:59:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842689210] [2022-12-05 23:59:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:40,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-05 23:59:40,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 23:59:40,033 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-05 23:59:40,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:40,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 23:59:40,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:40,316 INFO L130 PetriNetUnfolder]: 996/1731 cut-off events. [2022-12-05 23:59:40,316 INFO L131 PetriNetUnfolder]: For 10802/10802 co-relation queries the response was YES. [2022-12-05 23:59:40,329 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-05 23:59:40,337 INFO L137 encePairwiseOnDemand]: 12/32 looper letters, 253 selfloop transitions, 31 changer transitions 8/292 dead transitions. [2022-12-05 23:59:40,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 292 transitions, 4292 flow [2022-12-05 23:59:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 23:59:40,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-05 23:59:40,339 INFO L175 Difference]: Start difference. First operand has 81 places, 258 transitions, 3300 flow. Second operand 4 states and 52 transitions. [2022-12-05 23:59:40,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 292 transitions, 4292 flow [2022-12-05 23:59:40,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 292 transitions, 4147 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-12-05 23:59:40,434 INFO L231 Difference]: Finished difference. Result has 81 places, 266 transitions, 3388 flow [2022-12-05 23:59:40,434 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-05 23:59:40,435 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 62 predicate places. [2022-12-05 23:59:40,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:40,435 INFO L89 Accepts]: Start accepts. Operand has 81 places, 266 transitions, 3388 flow [2022-12-05 23:59:40,436 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:40,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:40,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 266 transitions, 3388 flow [2022-12-05 23:59:40,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 266 transitions, 3388 flow [2022-12-05 23:59:40,514 INFO L130 PetriNetUnfolder]: 314/728 cut-off events. [2022-12-05 23:59:40,514 INFO L131 PetriNetUnfolder]: For 4426/4508 co-relation queries the response was YES. [2022-12-05 23:59:40,516 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-05 23:59:40,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 266 transitions, 3388 flow [2022-12-05 23:59:40,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-05 23:59:40,521 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:40,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-05 23:59:40,522 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 266 transitions, 3388 flow [2022-12-05 23:59:40,522 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-05 23:59:40,522 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:40,522 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:40,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 23:59:40,727 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-05 23:59:40,729 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-05 23:59:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1330334046, now seen corresponding path program 1 times [2022-12-05 23:59:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:40,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984421669] [2022-12-05 23:59:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:41,001 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-05 23:59:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984421669] [2022-12-05 23:59:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984421669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818431147] [2022-12-05 23:59:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:41,007 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-05 23:59:41,009 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-05 23:59:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:41,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 23:59:41,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:42,806 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-05 23:59:42,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:59:43,672 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-05 23:59:43,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818431147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:59:43,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:59:43,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-05 23:59:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270514517] [2022-12-05 23:59:43,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:59:43,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 23:59:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 23:59:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-05 23:59:43,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-05 23:59:43,674 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-05 23:59:43,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:43,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-05 23:59:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:47,770 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 [0] [2022-12-05 23:59:48,228 INFO L130 PetriNetUnfolder]: 1208/2108 cut-off events. [2022-12-05 23:59:48,228 INFO L131 PetriNetUnfolder]: For 12114/12114 co-relation queries the response was YES. [2022-12-05 23:59:48,233 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-05 23:59:48,242 INFO L137 encePairwiseOnDemand]: 9/32 looper letters, 295 selfloop transitions, 94 changer transitions 50/439 dead transitions. [2022-12-05 23:59:48,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 439 transitions, 5931 flow [2022-12-05 23:59:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 23:59:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 23:59:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 192 transitions. [2022-12-05 23:59:48,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 23:59:48,244 INFO L175 Difference]: Start difference. First operand has 80 places, 266 transitions, 3388 flow. Second operand 20 states and 192 transitions. [2022-12-05 23:59:48,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 439 transitions, 5931 flow [2022-12-05 23:59:48,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 439 transitions, 5895 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-05 23:59:48,297 INFO L231 Difference]: Finished difference. Result has 111 places, 332 transitions, 4596 flow [2022-12-05 23:59:48,297 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-05 23:59:48,297 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 92 predicate places. [2022-12-05 23:59:48,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:48,298 INFO L89 Accepts]: Start accepts. Operand has 111 places, 332 transitions, 4596 flow [2022-12-05 23:59:48,299 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:48,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:48,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-05 23:59:48,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 332 transitions, 4596 flow [2022-12-05 23:59:48,360 INFO L130 PetriNetUnfolder]: 378/887 cut-off events. [2022-12-05 23:59:48,360 INFO L131 PetriNetUnfolder]: For 7799/7904 co-relation queries the response was YES. [2022-12-05 23:59:48,362 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-05 23:59:48,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 332 transitions, 4596 flow [2022-12-05 23:59:48,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-05 23:59:48,478 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-05 23:59:48,531 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-05 23:59:48,721 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-05 23:59:48,907 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-05 23:59:48,982 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-05 23:59:49,018 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-05 23:59:49,106 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-05 23:59:49,169 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-05 23:59:49,245 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-05 23:59:49,341 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-05 23:59:49,430 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 23:59:49,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1132 [2022-12-05 23:59:49,430 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 331 transitions, 4763 flow [2022-12-05 23:59:49,431 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-05 23:59:49,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:49,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:49,437 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-05 23:59:49,631 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-05 23:59:49,631 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-05 23:59:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1157178787, now seen corresponding path program 1 times [2022-12-05 23:59:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:49,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550982139] [2022-12-05 23:59:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:49,682 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-05 23:59:49,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:49,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550982139] [2022-12-05 23:59:49,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550982139] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:49,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657183373] [2022-12-05 23:59:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:49,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:49,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:49,720 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-05 23:59:49,722 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-05 23:59:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:49,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 23:59:49,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:49,838 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-05 23:59:49,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:59:49,862 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-05 23:59:49,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657183373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:59:49,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:59:49,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-05 23:59:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066774102] [2022-12-05 23:59:49,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:59:49,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 23:59:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 23:59:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-05 23:59:49,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-05 23:59:49,864 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-05 23:59:49,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:49,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-05 23:59:49,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:50,571 INFO L130 PetriNetUnfolder]: 2273/3812 cut-off events. [2022-12-05 23:59:50,572 INFO L131 PetriNetUnfolder]: For 32138/32138 co-relation queries the response was YES. [2022-12-05 23:59:50,581 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-05 23:59:50,597 INFO L137 encePairwiseOnDemand]: 12/48 looper letters, 437 selfloop transitions, 424 changer transitions 6/867 dead transitions. [2022-12-05 23:59:50,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 867 transitions, 13303 flow [2022-12-05 23:59:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 23:59:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 23:59:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2022-12-05 23:59:50,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1949404761904762 [2022-12-05 23:59:50,599 INFO L175 Difference]: Start difference. First operand has 110 places, 331 transitions, 4763 flow. Second operand 14 states and 131 transitions. [2022-12-05 23:59:50,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 867 transitions, 13303 flow [2022-12-05 23:59:50,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 867 transitions, 12600 flow, removed 335 selfloop flow, removed 5 redundant places. [2022-12-05 23:59:50,766 INFO L231 Difference]: Finished difference. Result has 127 places, 616 transitions, 10167 flow [2022-12-05 23:59:50,766 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-05 23:59:50,767 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 108 predicate places. [2022-12-05 23:59:50,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:50,767 INFO L89 Accepts]: Start accepts. Operand has 127 places, 616 transitions, 10167 flow [2022-12-05 23:59:50,768 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:50,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:50,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 616 transitions, 10167 flow [2022-12-05 23:59:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 616 transitions, 10167 flow [2022-12-05 23:59:50,957 INFO L130 PetriNetUnfolder]: 773/1637 cut-off events. [2022-12-05 23:59:50,957 INFO L131 PetriNetUnfolder]: For 22622/24004 co-relation queries the response was YES. [2022-12-05 23:59:50,963 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-05 23:59:50,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 616 transitions, 10167 flow [2022-12-05 23:59:50,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 1396 [2022-12-05 23:59:50,975 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-05 23:59:51,029 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-05 23:59:51,116 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-05 23:59:51,221 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-05 23:59:51,265 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-05 23:59:51,307 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-05 23:59:51,400 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:59:51,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-05 23:59:51,400 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 616 transitions, 10205 flow [2022-12-05 23:59:51,401 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-05 23:59:51,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:51,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:51,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-05 23:59:51,601 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-05 23:59:51,601 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-05 23:59:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash -103742838, now seen corresponding path program 1 times [2022-12-05 23:59:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:51,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917994770] [2022-12-05 23:59:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:51,643 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-05 23:59:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:51,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917994770] [2022-12-05 23:59:51,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917994770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:59:51,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:59:51,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:59:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991803569] [2022-12-05 23:59:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:59:51,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:59:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:59:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:59:51,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-05 23:59:51,647 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-05 23:59:51,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:51,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-05 23:59:51,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:52,419 INFO L130 PetriNetUnfolder]: 2288/3801 cut-off events. [2022-12-05 23:59:52,420 INFO L131 PetriNetUnfolder]: For 49635/49635 co-relation queries the response was YES. [2022-12-05 23:59:52,431 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-05 23:59:52,446 INFO L137 encePairwiseOnDemand]: 28/48 looper letters, 605 selfloop transitions, 41 changer transitions 0/646 dead transitions. [2022-12-05 23:59:52,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 646 transitions, 12177 flow [2022-12-05 23:59:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:59:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:59:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-05 23:59:52,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-05 23:59:52,448 INFO L175 Difference]: Start difference. First operand has 125 places, 616 transitions, 10205 flow. Second operand 4 states and 70 transitions. [2022-12-05 23:59:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 646 transitions, 12177 flow [2022-12-05 23:59:52,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 646 transitions, 11466 flow, removed 345 selfloop flow, removed 3 redundant places. [2022-12-05 23:59:52,784 INFO L231 Difference]: Finished difference. Result has 125 places, 598 transitions, 9695 flow [2022-12-05 23:59:52,784 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-05 23:59:52,785 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 106 predicate places. [2022-12-05 23:59:52,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:52,785 INFO L89 Accepts]: Start accepts. Operand has 125 places, 598 transitions, 9695 flow [2022-12-05 23:59:52,786 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:52,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:52,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 598 transitions, 9695 flow [2022-12-05 23:59:52,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 598 transitions, 9695 flow [2022-12-05 23:59:52,951 INFO L130 PetriNetUnfolder]: 781/1632 cut-off events. [2022-12-05 23:59:52,951 INFO L131 PetriNetUnfolder]: For 20841/21160 co-relation queries the response was YES. [2022-12-05 23:59:52,957 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-05 23:59:52,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 598 transitions, 9695 flow [2022-12-05 23:59:52,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 1356 [2022-12-05 23:59:52,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:59:52,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-05 23:59:52,981 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 598 transitions, 9695 flow [2022-12-05 23:59:52,981 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-05 23:59:52,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:52,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:59:52,983 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-05 23:59:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 435658600, now seen corresponding path program 1 times [2022-12-05 23:59:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:52,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536011623] [2022-12-05 23:59:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:53,202 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-05 23:59:53,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:53,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536011623] [2022-12-05 23:59:53,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536011623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:53,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626291006] [2022-12-05 23:59:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:53,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:53,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:53,204 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-05 23:59:53,220 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-05 23:59:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:53,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 23:59:53,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:55,110 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-05 23:59:55,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 23:59:55,411 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-05 23:59:55,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626291006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 23:59:55,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 23:59:55,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-05 23:59:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819534220] [2022-12-05 23:59:55,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 23:59:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 23:59:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:59:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 23:59:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-05 23:59:55,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-05 23:59:55,412 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-05 23:59:55,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:59:55,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-05 23:59:55,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:59:57,645 INFO L130 PetriNetUnfolder]: 2392/3993 cut-off events. [2022-12-05 23:59:57,645 INFO L131 PetriNetUnfolder]: For 44485/44485 co-relation queries the response was YES. [2022-12-05 23:59:57,657 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-05 23:59:57,689 INFO L137 encePairwiseOnDemand]: 9/45 looper letters, 577 selfloop transitions, 111 changer transitions 24/712 dead transitions. [2022-12-05 23:59:57,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 712 transitions, 12498 flow [2022-12-05 23:59:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 23:59:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 23:59:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-12-05 23:59:57,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19084967320261437 [2022-12-05 23:59:57,690 INFO L175 Difference]: Start difference. First operand has 125 places, 598 transitions, 9695 flow. Second operand 17 states and 146 transitions. [2022-12-05 23:59:57,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 712 transitions, 12498 flow [2022-12-05 23:59:58,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 712 transitions, 12308 flow, removed 82 selfloop flow, removed 4 redundant places. [2022-12-05 23:59:58,056 INFO L231 Difference]: Finished difference. Result has 143 places, 637 transitions, 10500 flow [2022-12-05 23:59:58,057 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-05 23:59:58,062 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 124 predicate places. [2022-12-05 23:59:58,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:59:58,062 INFO L89 Accepts]: Start accepts. Operand has 143 places, 637 transitions, 10500 flow [2022-12-05 23:59:58,064 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:59:58,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:59:58,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 637 transitions, 10500 flow [2022-12-05 23:59:58,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 637 transitions, 10500 flow [2022-12-05 23:59:58,244 INFO L130 PetriNetUnfolder]: 808/1694 cut-off events. [2022-12-05 23:59:58,244 INFO L131 PetriNetUnfolder]: For 21168/22360 co-relation queries the response was YES. [2022-12-05 23:59:58,249 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-05 23:59:58,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 637 transitions, 10500 flow [2022-12-05 23:59:58,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 1458 [2022-12-05 23:59:58,304 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-05 23:59:58,543 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-05 23:59:58,627 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-05 23:59:58,684 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-05 23:59:58,932 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-05 23:59:59,091 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-05 23:59:59,293 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 23:59:59,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1231 [2022-12-05 23:59:59,293 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 636 transitions, 10633 flow [2022-12-05 23:59:59,294 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-05 23:59:59,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:59:59,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:59:59,306 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-05 23:59:59,497 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-05 23:59:59,498 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-05 23:59:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:59:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 422726202, now seen corresponding path program 1 times [2022-12-05 23:59:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:59:59,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802100782] [2022-12-05 23:59:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:59,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:59:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:59,689 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-05 23:59:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:59:59,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802100782] [2022-12-05 23:59:59,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802100782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 23:59:59,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431796253] [2022-12-05 23:59:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:59:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 23:59:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:59:59,691 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-05 23:59:59,726 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-05 23:59:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:59:59,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 23:59:59,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 23:59:59,934 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-05 23:59:59,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:00,244 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 00:00:00,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431796253] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:00:00,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:00:00,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2022-12-06 00:00:00,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743156635] [2022-12-06 00:00:00,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:00:00,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:00:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:00:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:00:00,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 00:00:00,245 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 00:00:00,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:00,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 00:00:00,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:02,374 INFO L130 PetriNetUnfolder]: 2753/4618 cut-off events. [2022-12-06 00:00:02,375 INFO L131 PetriNetUnfolder]: For 51528/51528 co-relation queries the response was YES. [2022-12-06 00:00:02,394 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 00:00:02,415 INFO L137 encePairwiseOnDemand]: 10/58 looper letters, 382 selfloop transitions, 443 changer transitions 32/857 dead transitions. [2022-12-06 00:00:02,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 857 transitions, 15824 flow [2022-12-06 00:00:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:00:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:00:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-12-06 00:00:02,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1627155172413793 [2022-12-06 00:00:02,417 INFO L175 Difference]: Start difference. First operand has 142 places, 636 transitions, 10633 flow. Second operand 16 states and 151 transitions. [2022-12-06 00:00:02,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 857 transitions, 15824 flow [2022-12-06 00:00:02,865 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 00:00:02,877 INFO L231 Difference]: Finished difference. Result has 158 places, 779 transitions, 14682 flow [2022-12-06 00:00:02,878 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 00:00:02,878 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 139 predicate places. [2022-12-06 00:00:02,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:02,878 INFO L89 Accepts]: Start accepts. Operand has 158 places, 779 transitions, 14682 flow [2022-12-06 00:00:02,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:02,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:02,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 779 transitions, 14682 flow [2022-12-06 00:00:02,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 779 transitions, 14682 flow [2022-12-06 00:00:03,162 INFO L130 PetriNetUnfolder]: 916/1897 cut-off events. [2022-12-06 00:00:03,162 INFO L131 PetriNetUnfolder]: For 28659/31167 co-relation queries the response was YES. [2022-12-06 00:00:03,170 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 00:00:03,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 779 transitions, 14682 flow [2022-12-06 00:00:03,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 1748 [2022-12-06 00:00:03,203 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 00:00:03,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 00:00:03,571 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:03,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 693 [2022-12-06 00:00:03,571 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 777 transitions, 14708 flow [2022-12-06 00:00:03,572 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 00:00:03,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:03,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:03,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 00:00:03,775 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 00:00:03,775 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 00:00:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -673633922, now seen corresponding path program 1 times [2022-12-06 00:00:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:03,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791048462] [2022-12-06 00:00:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:04,084 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 00:00:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:04,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791048462] [2022-12-06 00:00:04,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791048462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:04,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494284129] [2022-12-06 00:00:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:04,116 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 00:00:04,118 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 00:00:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:04,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 00:00:04,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:05,803 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 00:00:05,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:06,006 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 00:00:06,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494284129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:00:06,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:00:06,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 10 [2022-12-06 00:00:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916422588] [2022-12-06 00:00:06,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:00:06,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:00:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:06,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:00:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:00:06,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:00:06,008 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 00:00:06,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:06,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:00:06,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:11,543 INFO L130 PetriNetUnfolder]: 2907/4856 cut-off events. [2022-12-06 00:00:11,547 INFO L131 PetriNetUnfolder]: For 60393/60393 co-relation queries the response was YES. [2022-12-06 00:00:11,564 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 00:00:11,603 INFO L137 encePairwiseOnDemand]: 10/61 looper letters, 735 selfloop transitions, 187 changer transitions 34/956 dead transitions. [2022-12-06 00:00:11,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 956 transitions, 19263 flow [2022-12-06 00:00:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 00:00:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 00:00:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 190 transitions. [2022-12-06 00:00:11,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17304189435336975 [2022-12-06 00:00:11,609 INFO L175 Difference]: Start difference. First operand has 153 places, 777 transitions, 14708 flow. Second operand 18 states and 190 transitions. [2022-12-06 00:00:11,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 956 transitions, 19263 flow [2022-12-06 00:00:12,204 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 00:00:12,230 INFO L231 Difference]: Finished difference. Result has 175 places, 853 transitions, 16155 flow [2022-12-06 00:00:12,231 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 00:00:12,232 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 156 predicate places. [2022-12-06 00:00:12,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:12,232 INFO L89 Accepts]: Start accepts. Operand has 175 places, 853 transitions, 16155 flow [2022-12-06 00:00:12,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:12,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:12,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 853 transitions, 16155 flow [2022-12-06 00:00:12,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 853 transitions, 16155 flow [2022-12-06 00:00:12,753 INFO L130 PetriNetUnfolder]: 981/2061 cut-off events. [2022-12-06 00:00:12,753 INFO L131 PetriNetUnfolder]: For 31536/34551 co-relation queries the response was YES. [2022-12-06 00:00:12,763 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 00:00:12,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 853 transitions, 16155 flow [2022-12-06 00:00:12,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-06 00:00:12,793 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 00:00:12,947 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 00:00:13,100 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 00:00:13,176 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 00:00:13,245 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 00:00:13,411 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:00:13,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1179 [2022-12-06 00:00:13,411 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 853 transitions, 16240 flow [2022-12-06 00:00:13,412 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 00:00:13,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:13,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:13,443 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 00:00:13,627 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 00:00:13,627 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 00:00:13,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2001142799, now seen corresponding path program 1 times [2022-12-06 00:00:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:13,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368200693] [2022-12-06 00:00:13,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:13,764 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 00:00:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:13,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368200693] [2022-12-06 00:00:13,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368200693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:13,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:13,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:00:13,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963796291] [2022-12-06 00:00:13,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:13,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:13,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-06 00:00:13,766 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 00:00:13,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:13,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-06 00:00:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:16,123 INFO L130 PetriNetUnfolder]: 3783/6452 cut-off events. [2022-12-06 00:00:16,123 INFO L131 PetriNetUnfolder]: For 92259/92259 co-relation queries the response was YES. [2022-12-06 00:00:16,155 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 00:00:16,187 INFO L137 encePairwiseOnDemand]: 32/68 looper letters, 824 selfloop transitions, 364 changer transitions 5/1193 dead transitions. [2022-12-06 00:00:16,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1193 transitions, 24443 flow [2022-12-06 00:00:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-06 00:00:16,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33455882352941174 [2022-12-06 00:00:16,195 INFO L175 Difference]: Start difference. First operand has 175 places, 853 transitions, 16240 flow. Second operand 4 states and 91 transitions. [2022-12-06 00:00:16,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 1193 transitions, 24443 flow [2022-12-06 00:00:17,163 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 00:00:17,182 INFO L231 Difference]: Finished difference. Result has 176 places, 1005 transitions, 20183 flow [2022-12-06 00:00:17,183 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 00:00:17,183 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 157 predicate places. [2022-12-06 00:00:17,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:17,183 INFO L89 Accepts]: Start accepts. Operand has 176 places, 1005 transitions, 20183 flow [2022-12-06 00:00:17,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:17,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:17,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 1005 transitions, 20183 flow [2022-12-06 00:00:17,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 1005 transitions, 20183 flow [2022-12-06 00:00:17,714 INFO L130 PetriNetUnfolder]: 1281/2808 cut-off events. [2022-12-06 00:00:17,715 INFO L131 PetriNetUnfolder]: For 48856/53046 co-relation queries the response was YES. [2022-12-06 00:00:17,727 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 00:00:17,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 1005 transitions, 20183 flow [2022-12-06 00:00:17,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 2220 [2022-12-06 00:00:17,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:17,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 585 [2022-12-06 00:00:17,768 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 1005 transitions, 20183 flow [2022-12-06 00:00:17,769 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 00:00:17,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:17,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:17,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:00:17,769 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 00:00:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1475064365, now seen corresponding path program 1 times [2022-12-06 00:00:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:17,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638748096] [2022-12-06 00:00:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:17,833 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 00:00:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638748096] [2022-12-06 00:00:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638748096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:17,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:17,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319695003] [2022-12-06 00:00:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:17,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:17,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 00:00:17,836 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 00:00:17,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:17,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 00:00:17,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:19,846 INFO L130 PetriNetUnfolder]: 3791/6450 cut-off events. [2022-12-06 00:00:19,846 INFO L131 PetriNetUnfolder]: For 95589/95589 co-relation queries the response was YES. [2022-12-06 00:00:19,876 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 00:00:19,904 INFO L137 encePairwiseOnDemand]: 41/64 looper letters, 1053 selfloop transitions, 24 changer transitions 0/1077 dead transitions. [2022-12-06 00:00:19,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1077 transitions, 23855 flow [2022-12-06 00:00:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 00:00:19,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2022-12-06 00:00:19,906 INFO L175 Difference]: Start difference. First operand has 174 places, 1005 transitions, 20183 flow. Second operand 4 states and 86 transitions. [2022-12-06 00:00:19,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1077 transitions, 23855 flow [2022-12-06 00:00:20,733 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 00:00:20,750 INFO L231 Difference]: Finished difference. Result has 176 places, 1008 transitions, 20279 flow [2022-12-06 00:00:20,751 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 00:00:20,752 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 157 predicate places. [2022-12-06 00:00:20,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:20,753 INFO L89 Accepts]: Start accepts. Operand has 176 places, 1008 transitions, 20279 flow [2022-12-06 00:00:20,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:20,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:20,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 1008 transitions, 20279 flow [2022-12-06 00:00:20,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 1008 transitions, 20279 flow [2022-12-06 00:00:21,281 INFO L130 PetriNetUnfolder]: 1285/2810 cut-off events. [2022-12-06 00:00:21,281 INFO L131 PetriNetUnfolder]: For 50001/53462 co-relation queries the response was YES. [2022-12-06 00:00:21,295 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 00:00:21,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 1008 transitions, 20279 flow [2022-12-06 00:00:21,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 2230 [2022-12-06 00:00:21,326 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:21,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 575 [2022-12-06 00:00:21,327 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 1008 transitions, 20279 flow [2022-12-06 00:00:21,327 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 00:00:21,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:21,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:21,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:00:21,327 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 00:00:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1830476228, now seen corresponding path program 1 times [2022-12-06 00:00:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:21,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594509951] [2022-12-06 00:00:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:21,425 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 00:00:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594509951] [2022-12-06 00:00:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594509951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134397530] [2022-12-06 00:00:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:21,444 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 00:00:21,469 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 00:00:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:21,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:00:21,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:21,544 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 00:00:21,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:21,641 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 00:00:21,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134397530] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:00:21,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:00:21,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 00:00:21,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849697357] [2022-12-06 00:00:21,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:00:21,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:00:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:00:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:00:21,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 00:00:21,642 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 00:00:21,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:21,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 00:00:21,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:24,668 INFO L130 PetriNetUnfolder]: 4221/7232 cut-off events. [2022-12-06 00:00:24,668 INFO L131 PetriNetUnfolder]: For 122867/122867 co-relation queries the response was YES. [2022-12-06 00:00:24,703 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 00:00:24,759 INFO L137 encePairwiseOnDemand]: 29/64 looper letters, 1079 selfloop transitions, 150 changer transitions 0/1229 dead transitions. [2022-12-06 00:00:24,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 1229 transitions, 27343 flow [2022-12-06 00:00:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:00:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:00:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2022-12-06 00:00:24,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2204861111111111 [2022-12-06 00:00:24,760 INFO L175 Difference]: Start difference. First operand has 176 places, 1008 transitions, 20279 flow. Second operand 9 states and 127 transitions. [2022-12-06 00:00:24,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 1229 transitions, 27343 flow [2022-12-06 00:00:25,909 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 00:00:25,931 INFO L231 Difference]: Finished difference. Result has 183 places, 1015 transitions, 20666 flow [2022-12-06 00:00:25,936 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 00:00:25,943 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 164 predicate places. [2022-12-06 00:00:25,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:25,943 INFO L89 Accepts]: Start accepts. Operand has 183 places, 1015 transitions, 20666 flow [2022-12-06 00:00:25,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:25,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:25,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 1015 transitions, 20666 flow [2022-12-06 00:00:25,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 1015 transitions, 20666 flow [2022-12-06 00:00:26,600 INFO L130 PetriNetUnfolder]: 1407/3104 cut-off events. [2022-12-06 00:00:26,600 INFO L131 PetriNetUnfolder]: For 66924/69471 co-relation queries the response was YES. [2022-12-06 00:00:26,621 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 00:00:26,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 1015 transitions, 20666 flow [2022-12-06 00:00:26,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-06 00:00:26,659 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:26,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 718 [2022-12-06 00:00:26,661 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 1015 transitions, 20666 flow [2022-12-06 00:00:26,661 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 00:00:26,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:26,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:26,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 00:00:26,879 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 00:00:26,879 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 00:00:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1714181329, now seen corresponding path program 1 times [2022-12-06 00:00:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:26,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938961908] [2022-12-06 00:00:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:26,990 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 00:00:26,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:26,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938961908] [2022-12-06 00:00:26,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938961908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:26,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141733744] [2022-12-06 00:00:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:26,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:26,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:26,996 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 00:00:27,074 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 00:00:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:27,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 00:00:27,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:27,192 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 00:00:27,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:27,213 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 00:00:27,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141733744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:00:27,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:00:27,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 6 [2022-12-06 00:00:27,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248343462] [2022-12-06 00:00:27,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:00:27,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:00:27,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:27,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:00:27,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:00:27,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 00:00:27,214 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 00:00:27,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:27,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 00:00:27,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:30,756 INFO L130 PetriNetUnfolder]: 4869/8462 cut-off events. [2022-12-06 00:00:30,756 INFO L131 PetriNetUnfolder]: For 161803/161803 co-relation queries the response was YES. [2022-12-06 00:00:30,803 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 00:00:30,848 INFO L137 encePairwiseOnDemand]: 30/62 looper letters, 1123 selfloop transitions, 207 changer transitions 12/1342 dead transitions. [2022-12-06 00:00:30,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1342 transitions, 29237 flow [2022-12-06 00:00:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:00:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:00:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-12-06 00:00:30,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2157258064516129 [2022-12-06 00:00:30,849 INFO L175 Difference]: Start difference. First operand has 183 places, 1015 transitions, 20666 flow. Second operand 8 states and 107 transitions. [2022-12-06 00:00:30,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1342 transitions, 29237 flow [2022-12-06 00:00:32,367 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 00:00:32,408 INFO L231 Difference]: Finished difference. Result has 191 places, 1130 transitions, 23817 flow [2022-12-06 00:00:32,409 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 00:00:32,409 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 172 predicate places. [2022-12-06 00:00:32,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:32,409 INFO L89 Accepts]: Start accepts. Operand has 191 places, 1130 transitions, 23817 flow [2022-12-06 00:00:32,413 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:32,413 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:32,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 1130 transitions, 23817 flow [2022-12-06 00:00:32,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 1130 transitions, 23817 flow [2022-12-06 00:00:33,349 INFO L130 PetriNetUnfolder]: 1620/3677 cut-off events. [2022-12-06 00:00:33,349 INFO L131 PetriNetUnfolder]: For 84890/88122 co-relation queries the response was YES. [2022-12-06 00:00:33,366 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 00:00:33,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 1130 transitions, 23817 flow [2022-12-06 00:00:33,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 2510 [2022-12-06 00:00:33,403 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:33,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 999 [2022-12-06 00:00:33,408 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 1130 transitions, 23817 flow [2022-12-06 00:00:33,408 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 00:00:33,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:33,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:33,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 00:00:33,613 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 00:00:33,613 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 00:00:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1903726404, now seen corresponding path program 1 times [2022-12-06 00:00:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123445209] [2022-12-06 00:00:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:33,975 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 00:00:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:33,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123445209] [2022-12-06 00:00:33,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123445209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:33,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116429506] [2022-12-06 00:00:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:33,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:33,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:33,977 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 00:00:34,004 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 00:00:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:34,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 00:00:34,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:36,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 00:00:36,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:37,267 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 00:00:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116429506] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:00:37,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:00:37,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-06 00:00:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772380915] [2022-12-06 00:00:37,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:00:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:00:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:00:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=161, Unknown=1, NotChecked=0, Total=210 [2022-12-06 00:00:37,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:00:37,268 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 00:00:37,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:37,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:00:37,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:41,623 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 00:00:51,411 INFO L130 PetriNetUnfolder]: 5434/9554 cut-off events. [2022-12-06 00:00:51,415 INFO L131 PetriNetUnfolder]: For 190362/190362 co-relation queries the response was YES. [2022-12-06 00:00:51,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87036 conditions, 9554 events. 5434/9554 cut-off events. For 190362/190362 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 70621 event pairs, 70 based on Foata normal form. 2/9532 useless extension candidates. Maximal degree in co-relation 86749. Up to 8262 conditions per place. [2022-12-06 00:00:51,515 INFO L137 encePairwiseOnDemand]: 10/61 looper letters, 1072 selfloop transitions, 305 changer transitions 22/1399 dead transitions. [2022-12-06 00:00:51,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 1399 transitions, 31487 flow [2022-12-06 00:00:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:00:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:00:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 195 transitions. [2022-12-06 00:00:51,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13898788310762653 [2022-12-06 00:00:51,517 INFO L175 Difference]: Start difference. First operand has 191 places, 1130 transitions, 23817 flow. Second operand 23 states and 195 transitions. [2022-12-06 00:00:51,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 1399 transitions, 31487 flow [2022-12-06 00:00:54,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 1399 transitions, 30557 flow, removed 379 selfloop flow, removed 4 redundant places. [2022-12-06 00:00:54,087 INFO L231 Difference]: Finished difference. Result has 218 places, 1292 transitions, 27846 flow [2022-12-06 00:00:54,088 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=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=27846, PETRI_PLACES=218, PETRI_TRANSITIONS=1292} [2022-12-06 00:00:54,088 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 199 predicate places. [2022-12-06 00:00:54,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:54,088 INFO L89 Accepts]: Start accepts. Operand has 218 places, 1292 transitions, 27846 flow [2022-12-06 00:00:54,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:54,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:54,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 1292 transitions, 27846 flow [2022-12-06 00:00:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 1292 transitions, 27846 flow [2022-12-06 00:00:55,219 INFO L130 PetriNetUnfolder]: 1793/4156 cut-off events. [2022-12-06 00:00:55,219 INFO L131 PetriNetUnfolder]: For 99212/101399 co-relation queries the response was YES. [2022-12-06 00:00:55,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37946 conditions, 4156 events. 1793/4156 cut-off events. For 99212/101399 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 36188 event pairs, 28 based on Foata normal form. 5/4153 useless extension candidates. Maximal degree in co-relation 37768. Up to 1667 conditions per place. [2022-12-06 00:00:55,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 1292 transitions, 27846 flow [2022-12-06 00:00:55,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 2872 [2022-12-06 00:00:55,315 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 00:00:56,030 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 00:00:56,389 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 00:00:56,626 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 00:00:56,832 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 00:00:56,969 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 00:00:57,044 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 00:00:57,121 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 00:00:57,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3034 [2022-12-06 00:00:57,122 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 1292 transitions, 28030 flow [2022-12-06 00:00:57,122 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 00:00:57,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:57,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:57,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:00:57,339 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 00:00:57,339 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 00:00:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash 942478209, now seen corresponding path program 1 times [2022-12-06 00:00:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:57,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421423130] [2022-12-06 00:00:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:57,745 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 00:00:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:57,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421423130] [2022-12-06 00:00:57,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421423130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:57,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30748545] [2022-12-06 00:00:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:57,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:57,751 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 00:00:57,768 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 00:00:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:57,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 00:00:57,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:58,295 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 00:00:58,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:58,582 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 00:00:58,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30748545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:00:58,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:00:58,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 00:00:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162238014] [2022-12-06 00:00:58,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:00:58,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:00:58,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:58,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:00:58,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:00:58,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:00:58,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 1292 transitions, 28030 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 00:00:58,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:58,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:00:58,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:08,626 INFO L130 PetriNetUnfolder]: 5631/9907 cut-off events. [2022-12-06 00:01:08,626 INFO L131 PetriNetUnfolder]: For 204248/204248 co-relation queries the response was YES. [2022-12-06 00:01:08,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92525 conditions, 9907 events. 5631/9907 cut-off events. For 204248/204248 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 73653 event pairs, 56 based on Foata normal form. 2/9885 useless extension candidates. Maximal degree in co-relation 92264. Up to 6602 conditions per place. [2022-12-06 00:01:08,726 INFO L137 encePairwiseOnDemand]: 10/75 looper letters, 697 selfloop transitions, 731 changer transitions 25/1453 dead transitions. [2022-12-06 00:01:08,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1453 transitions, 33842 flow [2022-12-06 00:01:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:01:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:01:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2022-12-06 00:01:08,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13254901960784313 [2022-12-06 00:01:08,740 INFO L175 Difference]: Start difference. First operand has 218 places, 1292 transitions, 28030 flow. Second operand 17 states and 169 transitions. [2022-12-06 00:01:08,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1453 transitions, 33842 flow [2022-12-06 00:01:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1453 transitions, 32985 flow, removed 394 selfloop flow, removed 4 redundant places. [2022-12-06 00:01:11,096 INFO L231 Difference]: Finished difference. Result has 237 places, 1396 transitions, 32537 flow [2022-12-06 00:01:11,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=27197, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=637, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=32537, PETRI_PLACES=237, PETRI_TRANSITIONS=1396} [2022-12-06 00:01:11,097 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 218 predicate places. [2022-12-06 00:01:11,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:11,097 INFO L89 Accepts]: Start accepts. Operand has 237 places, 1396 transitions, 32537 flow [2022-12-06 00:01:11,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:11,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:11,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 1396 transitions, 32537 flow [2022-12-06 00:01:11,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 1396 transitions, 32537 flow [2022-12-06 00:01:12,155 INFO L130 PetriNetUnfolder]: 1852/4289 cut-off events. [2022-12-06 00:01:12,155 INFO L131 PetriNetUnfolder]: For 112759/114527 co-relation queries the response was YES. [2022-12-06 00:01:12,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41702 conditions, 4289 events. 1852/4289 cut-off events. For 112759/114527 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 37422 event pairs, 24 based on Foata normal form. 11/4291 useless extension candidates. Maximal degree in co-relation 41535. Up to 1724 conditions per place. [2022-12-06 00:01:12,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 1396 transitions, 32537 flow [2022-12-06 00:01:12,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 3108 [2022-12-06 00:01:12,282 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 00:01:12,349 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 00:01:12,409 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 00:01:12,506 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 00:01:12,624 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 00:01:12,743 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 00:01:12,920 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:01:12,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1823 [2022-12-06 00:01:12,920 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 1396 transitions, 32682 flow [2022-12-06 00:01:12,921 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 00:01:12,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:12,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:12,927 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 00:01:13,127 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 00:01:13,128 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 00:01:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash -998295741, now seen corresponding path program 1 times [2022-12-06 00:01:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390650960] [2022-12-06 00:01:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:13,514 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 00:01:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:13,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390650960] [2022-12-06 00:01:13,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390650960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:01:13,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316869066] [2022-12-06 00:01:13,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:13,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:01:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:01:13,517 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 00:01:13,547 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 00:01:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:13,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 00:01:13,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:01:13,933 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 00:01:13,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:01:14,376 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 00:01:14,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316869066] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:01:14,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:01:14,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-06 00:01:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020656592] [2022-12-06 00:01:14,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:01:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:01:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:01:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:01:14,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 00:01:14,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 1396 transitions, 32682 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 00:01:14,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:14,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 00:01:14,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:18,852 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 [0] [2022-12-06 00:01:23,983 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 [0] [2022-12-06 00:01:28,119 INFO L130 PetriNetUnfolder]: 6442/11386 cut-off events. [2022-12-06 00:01:28,120 INFO L131 PetriNetUnfolder]: For 269218/269218 co-relation queries the response was YES. [2022-12-06 00:01:28,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113354 conditions, 11386 events. 6442/11386 cut-off events. For 269218/269218 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 86404 event pairs, 42 based on Foata normal form. 2/11358 useless extension candidates. Maximal degree in co-relation 113085. Up to 6575 conditions per place. [2022-12-06 00:01:28,283 INFO L137 encePairwiseOnDemand]: 10/81 looper letters, 708 selfloop transitions, 1011 changer transitions 21/1740 dead transitions. [2022-12-06 00:01:28,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1740 transitions, 43729 flow [2022-12-06 00:01:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:01:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:01:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 197 transitions. [2022-12-06 00:01:28,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12160493827160494 [2022-12-06 00:01:28,285 INFO L175 Difference]: Start difference. First operand has 231 places, 1396 transitions, 32682 flow. Second operand 20 states and 197 transitions. [2022-12-06 00:01:28,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1740 transitions, 43729 flow [2022-12-06 00:01:33,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1740 transitions, 42987 flow, removed 283 selfloop flow, removed 5 redundant places. [2022-12-06 00:01:33,129 INFO L231 Difference]: Finished difference. Result has 253 places, 1665 transitions, 42990 flow [2022-12-06 00:01:33,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=31971, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=767, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=42990, PETRI_PLACES=253, PETRI_TRANSITIONS=1665} [2022-12-06 00:01:33,130 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 234 predicate places. [2022-12-06 00:01:33,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:33,130 INFO L89 Accepts]: Start accepts. Operand has 253 places, 1665 transitions, 42990 flow [2022-12-06 00:01:33,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:33,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:33,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 253 places, 1665 transitions, 42990 flow [2022-12-06 00:01:33,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 1665 transitions, 42990 flow [2022-12-06 00:01:35,711 INFO L130 PetriNetUnfolder]: 2127/4978 cut-off events. [2022-12-06 00:01:35,711 INFO L131 PetriNetUnfolder]: For 156074/160353 co-relation queries the response was YES. [2022-12-06 00:01:35,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52762 conditions, 4978 events. 2127/4978 cut-off events. For 156074/160353 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 44566 event pairs, 18 based on Foata normal form. 5/4973 useless extension candidates. Maximal degree in co-relation 52587. Up to 2080 conditions per place. [2022-12-06 00:01:35,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 1665 transitions, 42990 flow [2022-12-06 00:01:35,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 3650 [2022-12-06 00:01:36,119 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 00:01:36,176 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 00:01:36,653 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 00:01:37,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [499] L41-6-->L40-1: Formula: (and (= v_~k1~0_386 (+ v_~k1~0_387 1)) (not (< v_~j1~0_414 v_~m~0_267)) (< v_~j1~0_415 v_~m~0_267) (= v_~j1~0_414 (+ v_~j1~0_415 1)) (= (+ v_~i1~0_368 1) v_~i1~0_367)) InVars {~m~0=v_~m~0_267, ~k1~0=v_~k1~0_387, ~j1~0=v_~j1~0_415, ~i1~0=v_~i1~0_368} OutVars{~m~0=v_~m~0_267, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_208|, ~k1~0=v_~k1~0_386, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_210|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_152|, ~j1~0=v_~j1~0_414, ~i1~0=v_~i1~0_367} 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 00:01:37,245 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 00:01:37,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 00:01:37,631 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 00:01:37,632 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 00:01:37,635 INFO L158 Benchmark]: Toolchain (without parser) took 136790.80ms. Allocated memory was 194.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 170.1MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 00:01:37,635 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 170.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:01:37,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.35ms. Allocated memory is still 194.0MB. Free memory was 169.6MB in the beginning and 159.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 00:01:37,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 194.0MB. Free memory was 158.6MB in the beginning and 157.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:01:37,635 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 194.0MB. Free memory was 157.4MB in the beginning and 156.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:01:37,636 INFO L158 Benchmark]: RCFGBuilder took 373.95ms. Allocated memory is still 194.0MB. Free memory was 156.0MB in the beginning and 142.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:01:37,636 INFO L158 Benchmark]: TraceAbstraction took 136195.00ms. Allocated memory was 194.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 141.8MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 00:01:37,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 170.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 154.35ms. Allocated memory is still 194.0MB. Free memory was 169.6MB in the beginning and 159.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 194.0MB. Free memory was 158.6MB in the beginning and 157.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 194.0MB. Free memory was 157.4MB in the beginning and 156.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 373.95ms. Allocated memory is still 194.0MB. Free memory was 156.0MB in the beginning and 142.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 136195.00ms. Allocated memory was 194.0MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 141.8MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 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.4s, 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.0s, 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.6s, 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: 1.8s, 218 PlacesBefore, 218 PlacesAfterwards, 1292 TransitionsBefore, 1292 TransitionsAfterwards, 2872 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, 1396 TransitionsBefore, 1396 TransitionsAfterwards, 3108 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 00:01:37,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...