./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:17:46,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:17:46,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:17:46,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:17:46,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:17:46,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:17:46,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:17:46,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:17:46,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:17:46,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:17:46,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:17:46,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:17:46,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:17:46,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:17:46,199 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:17:46,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:17:46,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:17:46,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:17:46,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:17:46,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:17:46,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:17:46,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:17:46,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:17:46,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:17:46,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:17:46,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:17:46,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:17:46,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:17:46,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:17:46,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:17:46,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2024-10-14 14:17:46,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:17:46,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:17:46,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:17:46,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:17:46,449 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:17:46,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2024-10-14 14:17:47,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:17:47,834 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:17:47,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2024-10-14 14:17:47,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d962e1f1/e8f9d928334e4f09a044a24137445635/FLAGa2e67b386 [2024-10-14 14:17:48,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d962e1f1/e8f9d928334e4f09a044a24137445635 [2024-10-14 14:17:48,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:17:48,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:17:48,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:17:48,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:17:48,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:17:48,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd95ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48, skipping insertion in model container [2024-10-14 14:17:48,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:17:48,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i[30963,30976] [2024-10-14 14:17:48,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:17:48,466 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:17:48,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i[30963,30976] [2024-10-14 14:17:48,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:17:48,522 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:17:48,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48 WrapperNode [2024-10-14 14:17:48,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:17:48,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:17:48,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:17:48,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:17:48,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,551 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-10-14 14:17:48,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:17:48,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:17:48,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:17:48,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:17:48,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 14:17:48,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:17:48,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:17:48,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:17:48,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:17:48,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (1/1) ... [2024-10-14 14:17:48,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:17:48,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:48,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:17:48,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:17:48,658 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-14 14:17:48,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-14 14:17:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-14 14:17:48,659 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-14 14:17:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 14:17:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:17:48,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:17:48,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 14:17:48,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:17:48,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:17:48,662 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:17:48,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:17:48,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:17:48,864 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:17:48,864 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:17:48,915 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:17:48,916 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 14:17:48,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:17:48 BoogieIcfgContainer [2024-10-14 14:17:48,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:17:48,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:17:48,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:17:48,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:17:48,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:17:48" (1/3) ... [2024-10-14 14:17:48,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7f5456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:17:48, skipping insertion in model container [2024-10-14 14:17:48,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:48" (2/3) ... [2024-10-14 14:17:48,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7f5456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:17:48, skipping insertion in model container [2024-10-14 14:17:48,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:17:48" (3/3) ... [2024-10-14 14:17:48,922 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-10-14 14:17:48,937 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:17:48,938 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:17:48,938 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:17:48,972 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 14:17:49,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-10-14 14:17:49,024 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-10-14 14:17:49,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:17:49,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-10-14 14:17:49,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-10-14 14:17:49,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-10-14 14:17:49,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:17:49,054 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@291309fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:17:49,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-14 14:17:49,064 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:17:49,064 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-10-14 14:17:49,064 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 14:17:49,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:49,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:49,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:49,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 762204344, now seen corresponding path program 1 times [2024-10-14 14:17:49,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593354023] [2024-10-14 14:17:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:49,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:49,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593354023] [2024-10-14 14:17:49,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593354023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:49,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:17:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159400096] [2024-10-14 14:17:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:49,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:17:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:17:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:17:49,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:49,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:49,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:49,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:49,680 INFO L124 PetriNetUnfolderBase]: 385/647 cut-off events. [2024-10-14 14:17:49,680 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 14:17:49,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 647 events. 385/647 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2667 event pairs, 57 based on Foata normal form. 15/646 useless extension candidates. Maximal degree in co-relation 1251. Up to 303 conditions per place. [2024-10-14 14:17:49,688 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 29 selfloop transitions, 7 changer transitions 31/70 dead transitions. [2024-10-14 14:17:49,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 70 transitions, 283 flow [2024-10-14 14:17:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:17:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 14:17:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-10-14 14:17:49,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-10-14 14:17:49,699 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 8 states and 111 transitions. [2024-10-14 14:17:49,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 70 transitions, 283 flow [2024-10-14 14:17:49,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 70 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:17:49,703 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 97 flow [2024-10-14 14:17:49,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2024-10-14 14:17:49,707 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2024-10-14 14:17:49,707 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 97 flow [2024-10-14 14:17:49,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:49,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:49,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:49,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:17:49,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -517073457, now seen corresponding path program 1 times [2024-10-14 14:17:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362373786] [2024-10-14 14:17:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362373786] [2024-10-14 14:17:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362373786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:49,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:49,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:17:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390136616] [2024-10-14 14:17:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:17:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:49,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:17:49,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:17:49,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:49,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) [2024-10-14 14:17:49,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:49,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:49,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:50,033 INFO L124 PetriNetUnfolderBase]: 247/446 cut-off events. [2024-10-14 14:17:50,033 INFO L125 PetriNetUnfolderBase]: For 416/422 co-relation queries the response was YES. [2024-10-14 14:17:50,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 446 events. 247/446 cut-off events. For 416/422 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1792 event pairs, 63 based on Foata normal form. 24/467 useless extension candidates. Maximal degree in co-relation 1158. Up to 190 conditions per place. [2024-10-14 14:17:50,039 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 27 selfloop transitions, 8 changer transitions 15/53 dead transitions. [2024-10-14 14:17:50,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 291 flow [2024-10-14 14:17:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:17:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 14:17:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-10-14 14:17:50,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-14 14:17:50,042 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 97 flow. Second operand 6 states and 76 transitions. [2024-10-14 14:17:50,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 291 flow [2024-10-14 14:17:50,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 287 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-14 14:17:50,047 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 141 flow [2024-10-14 14:17:50,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-10-14 14:17:50,050 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2024-10-14 14:17:50,050 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 141 flow [2024-10-14 14:17:50,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) [2024-10-14 14:17:50,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:50,050 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:50,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:17:50,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1754207660, now seen corresponding path program 1 times [2024-10-14 14:17:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758840040] [2024-10-14 14:17:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:50,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758840040] [2024-10-14 14:17:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758840040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:17:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921294534] [2024-10-14 14:17:50,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:50,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:17:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:50,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:17:50,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:17:50,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:50,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) [2024-10-14 14:17:50,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:50,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:50,345 INFO L124 PetriNetUnfolderBase]: 391/713 cut-off events. [2024-10-14 14:17:50,346 INFO L125 PetriNetUnfolderBase]: For 1184/1190 co-relation queries the response was YES. [2024-10-14 14:17:50,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 713 events. 391/713 cut-off events. For 1184/1190 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3059 event pairs, 89 based on Foata normal form. 33/745 useless extension candidates. Maximal degree in co-relation 2098. Up to 264 conditions per place. [2024-10-14 14:17:50,351 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 47 selfloop transitions, 11 changer transitions 20/81 dead transitions. [2024-10-14 14:17:50,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 515 flow [2024-10-14 14:17:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:17:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 14:17:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-10-14 14:17:50,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-10-14 14:17:50,354 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 141 flow. Second operand 9 states and 117 transitions. [2024-10-14 14:17:50,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 515 flow [2024-10-14 14:17:50,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 81 transitions, 473 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-10-14 14:17:50,361 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 237 flow [2024-10-14 14:17:50,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-10-14 14:17:50,362 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-10-14 14:17:50,362 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 237 flow [2024-10-14 14:17:50,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) [2024-10-14 14:17:50,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:50,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:50,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:17:50,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2024183696, now seen corresponding path program 2 times [2024-10-14 14:17:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490116251] [2024-10-14 14:17:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490116251] [2024-10-14 14:17:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490116251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:50,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:17:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254349961] [2024-10-14 14:17:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:50,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:17:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:50,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:17:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:17:50,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:50,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) [2024-10-14 14:17:50,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:50,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:50,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:50,631 INFO L124 PetriNetUnfolderBase]: 328/608 cut-off events. [2024-10-14 14:17:50,631 INFO L125 PetriNetUnfolderBase]: For 1943/1949 co-relation queries the response was YES. [2024-10-14 14:17:50,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 608 events. 328/608 cut-off events. For 1943/1949 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2541 event pairs, 89 based on Foata normal form. 51/658 useless extension candidates. Maximal degree in co-relation 2020. Up to 234 conditions per place. [2024-10-14 14:17:50,634 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 11 changer transitions 28/80 dead transitions. [2024-10-14 14:17:50,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 609 flow [2024-10-14 14:17:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:17:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 14:17:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-10-14 14:17:50,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-10-14 14:17:50,636 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 237 flow. Second operand 8 states and 103 transitions. [2024-10-14 14:17:50,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 609 flow [2024-10-14 14:17:50,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 565 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-10-14 14:17:50,641 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 268 flow [2024-10-14 14:17:50,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2024-10-14 14:17:50,642 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2024-10-14 14:17:50,642 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 268 flow [2024-10-14 14:17:50,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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) [2024-10-14 14:17:50,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:50,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:50,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:17:50,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 134530067, now seen corresponding path program 1 times [2024-10-14 14:17:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887254515] [2024-10-14 14:17:50,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887254515] [2024-10-14 14:17:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887254515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:17:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761453020] [2024-10-14 14:17:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:50,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:17:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:17:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:17:50,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:50,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:50,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:50,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:50,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:50,922 INFO L124 PetriNetUnfolderBase]: 463/851 cut-off events. [2024-10-14 14:17:50,923 INFO L125 PetriNetUnfolderBase]: For 4064/4070 co-relation queries the response was YES. [2024-10-14 14:17:50,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 851 events. 463/851 cut-off events. For 4064/4070 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3751 event pairs, 65 based on Foata normal form. 33/881 useless extension candidates. Maximal degree in co-relation 3135. Up to 181 conditions per place. [2024-10-14 14:17:50,927 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 54 selfloop transitions, 20 changer transitions 23/100 dead transitions. [2024-10-14 14:17:50,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 100 transitions, 818 flow [2024-10-14 14:17:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:17:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 14:17:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-10-14 14:17:50,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-10-14 14:17:50,929 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 268 flow. Second operand 11 states and 141 transitions. [2024-10-14 14:17:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 100 transitions, 818 flow [2024-10-14 14:17:50,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 100 transitions, 723 flow, removed 38 selfloop flow, removed 7 redundant places. [2024-10-14 14:17:50,937 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 378 flow [2024-10-14 14:17:50,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=378, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2024-10-14 14:17:50,938 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2024-10-14 14:17:50,938 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 378 flow [2024-10-14 14:17:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:50,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:50,939 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:17:50,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1091700605, now seen corresponding path program 2 times [2024-10-14 14:17:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783953280] [2024-10-14 14:17:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783953280] [2024-10-14 14:17:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783953280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:17:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911733466] [2024-10-14 14:17:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:17:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:17:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:17:51,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:51,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 378 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:51,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:51,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:51,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:51,224 INFO L124 PetriNetUnfolderBase]: 400/749 cut-off events. [2024-10-14 14:17:51,224 INFO L125 PetriNetUnfolderBase]: For 5302/5308 co-relation queries the response was YES. [2024-10-14 14:17:51,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 749 events. 400/749 cut-off events. For 5302/5308 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3284 event pairs, 65 based on Foata normal form. 51/797 useless extension candidates. Maximal degree in co-relation 3003. Up to 151 conditions per place. [2024-10-14 14:17:51,228 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 41 selfloop transitions, 20 changer transitions 31/95 dead transitions. [2024-10-14 14:17:51,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 902 flow [2024-10-14 14:17:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:17:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 14:17:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-10-14 14:17:51,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-10-14 14:17:51,229 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 378 flow. Second operand 10 states and 125 transitions. [2024-10-14 14:17:51,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 902 flow [2024-10-14 14:17:51,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 793 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-10-14 14:17:51,239 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 398 flow [2024-10-14 14:17:51,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=398, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-10-14 14:17:51,241 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2024-10-14 14:17:51,241 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 398 flow [2024-10-14 14:17:51,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:51,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:51,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:17:51,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:51,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992253, now seen corresponding path program 3 times [2024-10-14 14:17:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177153456] [2024-10-14 14:17:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:51,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177153456] [2024-10-14 14:17:51,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177153456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:17:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192211627] [2024-10-14 14:17:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:51,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:17:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:17:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:17:51,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:51,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:51,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:51,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:51,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:51,508 INFO L124 PetriNetUnfolderBase]: 409/755 cut-off events. [2024-10-14 14:17:51,509 INFO L125 PetriNetUnfolderBase]: For 5090/5096 co-relation queries the response was YES. [2024-10-14 14:17:51,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 755 events. 409/755 cut-off events. For 5090/5096 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3374 event pairs, 116 based on Foata normal form. 24/778 useless extension candidates. Maximal degree in co-relation 3028. Up to 363 conditions per place. [2024-10-14 14:17:51,512 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 52 selfloop transitions, 16 changer transitions 25/96 dead transitions. [2024-10-14 14:17:51,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 882 flow [2024-10-14 14:17:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:17:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 14:17:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-10-14 14:17:51,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-10-14 14:17:51,514 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 398 flow. Second operand 11 states and 135 transitions. [2024-10-14 14:17:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 882 flow [2024-10-14 14:17:51,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 798 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-10-14 14:17:51,520 INFO L231 Difference]: Finished difference. Result has 71 places, 46 transitions, 433 flow [2024-10-14 14:17:51,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=433, PETRI_PLACES=71, PETRI_TRANSITIONS=46} [2024-10-14 14:17:51,521 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 45 predicate places. [2024-10-14 14:17:51,521 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 46 transitions, 433 flow [2024-10-14 14:17:51,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:51,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:51,521 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:51,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:17:51,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1423899474, now seen corresponding path program 1 times [2024-10-14 14:17:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385807464] [2024-10-14 14:17:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385807464] [2024-10-14 14:17:51,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385807464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531200139] [2024-10-14 14:17:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:51,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:51,612 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) [2024-10-14 14:17:51,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:17:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:51,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 14:17:51,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:51,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531200139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:51,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:51,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-14 14:17:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187975831] [2024-10-14 14:17:51,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:51,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 14:17:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:51,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 14:17:51,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:17:51,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:51,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 46 transitions, 433 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:51,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:51,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:51,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:52,243 INFO L124 PetriNetUnfolderBase]: 643/1166 cut-off events. [2024-10-14 14:17:52,243 INFO L125 PetriNetUnfolderBase]: For 9744/9750 co-relation queries the response was YES. [2024-10-14 14:17:52,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4981 conditions, 1166 events. 643/1166 cut-off events. For 9744/9750 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5061 event pairs, 59 based on Foata normal form. 51/1214 useless extension candidates. Maximal degree in co-relation 4944. Up to 207 conditions per place. [2024-10-14 14:17:52,249 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 66 selfloop transitions, 35 changer transitions 56/160 dead transitions. [2024-10-14 14:17:52,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 160 transitions, 1559 flow [2024-10-14 14:17:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 14:17:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-14 14:17:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 236 transitions. [2024-10-14 14:17:52,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2024-10-14 14:17:52,252 INFO L175 Difference]: Start difference. First operand has 71 places, 46 transitions, 433 flow. Second operand 19 states and 236 transitions. [2024-10-14 14:17:52,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 160 transitions, 1559 flow [2024-10-14 14:17:52,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 160 transitions, 1482 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-10-14 14:17:52,262 INFO L231 Difference]: Finished difference. Result has 90 places, 62 transitions, 781 flow [2024-10-14 14:17:52,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=781, PETRI_PLACES=90, PETRI_TRANSITIONS=62} [2024-10-14 14:17:52,263 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2024-10-14 14:17:52,264 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 781 flow [2024-10-14 14:17:52,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:52,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:52,265 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:52,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:17:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:52,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:52,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1514895422, now seen corresponding path program 1 times [2024-10-14 14:17:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:52,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355782686] [2024-10-14 14:17:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:52,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355782686] [2024-10-14 14:17:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355782686] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940345566] [2024-10-14 14:17:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:52,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:52,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:52,609 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) [2024-10-14 14:17:52,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:17:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:52,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 14:17:52,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:52,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940345566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:52,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-14 14:17:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747820048] [2024-10-14 14:17:52,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:52,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 14:17:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:52,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 14:17:52,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-14 14:17:52,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:52,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 62 transitions, 781 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:52,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:52,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:52,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:53,460 INFO L124 PetriNetUnfolderBase]: 841/1577 cut-off events. [2024-10-14 14:17:53,461 INFO L125 PetriNetUnfolderBase]: For 23238/23244 co-relation queries the response was YES. [2024-10-14 14:17:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7809 conditions, 1577 events. 841/1577 cut-off events. For 23238/23244 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6922 event pairs, 215 based on Foata normal form. 87/1663 useless extension candidates. Maximal degree in co-relation 7765. Up to 756 conditions per place. [2024-10-14 14:17:53,470 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 95 selfloop transitions, 25 changer transitions 89/212 dead transitions. [2024-10-14 14:17:53,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 212 transitions, 2565 flow [2024-10-14 14:17:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 14:17:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-14 14:17:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 301 transitions. [2024-10-14 14:17:53,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5016666666666667 [2024-10-14 14:17:53,472 INFO L175 Difference]: Start difference. First operand has 90 places, 62 transitions, 781 flow. Second operand 25 states and 301 transitions. [2024-10-14 14:17:53,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 212 transitions, 2565 flow [2024-10-14 14:17:53,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 212 transitions, 2040 flow, removed 249 selfloop flow, removed 10 redundant places. [2024-10-14 14:17:53,501 INFO L231 Difference]: Finished difference. Result has 118 places, 76 transitions, 882 flow [2024-10-14 14:17:53,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=882, PETRI_PLACES=118, PETRI_TRANSITIONS=76} [2024-10-14 14:17:53,502 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2024-10-14 14:17:53,502 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 76 transitions, 882 flow [2024-10-14 14:17:53,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:53,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:53,503 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:53,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 14:17:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-14 14:17:53,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2021366800, now seen corresponding path program 2 times [2024-10-14 14:17:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469767228] [2024-10-14 14:17:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:53,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469767228] [2024-10-14 14:17:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469767228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391162298] [2024-10-14 14:17:53,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 14:17:53,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:53,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:53,833 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) [2024-10-14 14:17:53,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 14:17:53,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 14:17:53,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:17:53,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 14:17:53,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:53,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391162298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:54,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:54,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-14 14:17:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837529775] [2024-10-14 14:17:54,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:54,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 14:17:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 14:17:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-14 14:17:54,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:54,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 76 transitions, 882 flow. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:54,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:54,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:54,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:54,836 INFO L124 PetriNetUnfolderBase]: 1435/2711 cut-off events. [2024-10-14 14:17:54,836 INFO L125 PetriNetUnfolderBase]: For 73809/73815 co-relation queries the response was YES. [2024-10-14 14:17:54,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15196 conditions, 2711 events. 1435/2711 cut-off events. For 73809/73815 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 14454 event pairs, 136 based on Foata normal form. 87/2797 useless extension candidates. Maximal degree in co-relation 15139. Up to 501 conditions per place. [2024-10-14 14:17:54,885 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 127 selfloop transitions, 80 changer transitions 91/301 dead transitions. [2024-10-14 14:17:54,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 301 transitions, 4066 flow [2024-10-14 14:17:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 14:17:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-10-14 14:17:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 393 transitions. [2024-10-14 14:17:54,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2024-10-14 14:17:54,887 INFO L175 Difference]: Start difference. First operand has 118 places, 76 transitions, 882 flow. Second operand 32 states and 393 transitions. [2024-10-14 14:17:54,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 301 transitions, 4066 flow [2024-10-14 14:17:54,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 301 transitions, 3452 flow, removed 299 selfloop flow, removed 13 redundant places. [2024-10-14 14:17:54,936 INFO L231 Difference]: Finished difference. Result has 150 places, 119 transitions, 1713 flow [2024-10-14 14:17:54,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1713, PETRI_PLACES=150, PETRI_TRANSITIONS=119} [2024-10-14 14:17:54,937 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 124 predicate places. [2024-10-14 14:17:54,937 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 119 transitions, 1713 flow [2024-10-14 14:17:54,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:54,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:54,937 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:54,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 14:17:55,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:55,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:55,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash -983284332, now seen corresponding path program 3 times [2024-10-14 14:17:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:55,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906851121] [2024-10-14 14:17:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:55,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:55,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906851121] [2024-10-14 14:17:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906851121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:55,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404679317] [2024-10-14 14:17:55,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 14:17:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:55,276 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) [2024-10-14 14:17:55,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 14:17:55,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-14 14:17:55,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:17:55,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 14:17:55,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:55,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:55,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404679317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:55,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:55,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-14 14:17:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350431111] [2024-10-14 14:17:55,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:55,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 14:17:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:55,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 14:17:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-14 14:17:55,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:55,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 119 transitions, 1713 flow. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:55,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:55,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:55,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:56,541 INFO L124 PetriNetUnfolderBase]: 1822/3429 cut-off events. [2024-10-14 14:17:56,541 INFO L125 PetriNetUnfolderBase]: For 164399/164405 co-relation queries the response was YES. [2024-10-14 14:17:56,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22480 conditions, 3429 events. 1822/3429 cut-off events. For 164399/164405 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 19256 event pairs, 58 based on Foata normal form. 123/3551 useless extension candidates. Maximal degree in co-relation 22408. Up to 657 conditions per place. [2024-10-14 14:17:56,568 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 124 selfloop transitions, 121 changer transitions 115/363 dead transitions. [2024-10-14 14:17:56,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 363 transitions, 6090 flow [2024-10-14 14:17:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-14 14:17:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-14 14:17:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 443 transitions. [2024-10-14 14:17:56,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5127314814814815 [2024-10-14 14:17:56,571 INFO L175 Difference]: Start difference. First operand has 150 places, 119 transitions, 1713 flow. Second operand 36 states and 443 transitions. [2024-10-14 14:17:56,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 363 transitions, 6090 flow [2024-10-14 14:17:56,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 363 transitions, 5182 flow, removed 440 selfloop flow, removed 16 redundant places. [2024-10-14 14:17:56,743 INFO L231 Difference]: Finished difference. Result has 183 places, 154 transitions, 2571 flow [2024-10-14 14:17:56,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2571, PETRI_PLACES=183, PETRI_TRANSITIONS=154} [2024-10-14 14:17:56,744 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 157 predicate places. [2024-10-14 14:17:56,744 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 154 transitions, 2571 flow [2024-10-14 14:17:56,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:56,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:56,744 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:56,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 14:17:56,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:56,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:56,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2083707491, now seen corresponding path program 4 times [2024-10-14 14:17:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686416193] [2024-10-14 14:17:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686416193] [2024-10-14 14:17:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686416193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:57,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327273469] [2024-10-14 14:17:57,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 14:17:57,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:57,106 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) [2024-10-14 14:17:57,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 14:17:57,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 14:17:57,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:17:57,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 14:17:57,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:57,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327273469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:57,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:57,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-10-14 14:17:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088768892] [2024-10-14 14:17:57,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:57,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 14:17:57,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:57,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 14:17:57,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-10-14 14:17:57,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:17:57,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 154 transitions, 2571 flow. Second operand has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:57,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:57,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:17:57,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:58,942 INFO L124 PetriNetUnfolderBase]: 2632/4896 cut-off events. [2024-10-14 14:17:58,942 INFO L125 PetriNetUnfolderBase]: For 356048/356054 co-relation queries the response was YES. [2024-10-14 14:17:58,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38206 conditions, 4896 events. 2632/4896 cut-off events. For 356048/356054 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 26536 event pairs, 89 based on Foata normal form. 105/4998 useless extension candidates. Maximal degree in co-relation 38120. Up to 975 conditions per place. [2024-10-14 14:17:58,976 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 164 selfloop transitions, 176 changer transitions 146/489 dead transitions. [2024-10-14 14:17:58,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 489 transitions, 10254 flow [2024-10-14 14:17:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-14 14:17:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2024-10-14 14:17:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 602 transitions. [2024-10-14 14:17:58,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-10-14 14:17:58,979 INFO L175 Difference]: Start difference. First operand has 183 places, 154 transitions, 2571 flow. Second operand 49 states and 602 transitions. [2024-10-14 14:17:58,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 489 transitions, 10254 flow [2024-10-14 14:17:59,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 489 transitions, 8546 flow, removed 824 selfloop flow, removed 20 redundant places. [2024-10-14 14:17:59,273 INFO L231 Difference]: Finished difference. Result has 233 places, 215 transitions, 4157 flow [2024-10-14 14:17:59,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=4157, PETRI_PLACES=233, PETRI_TRANSITIONS=215} [2024-10-14 14:17:59,274 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 207 predicate places. [2024-10-14 14:17:59,274 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 215 transitions, 4157 flow [2024-10-14 14:17:59,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:59,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:59,274 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:59,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 14:17:59,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 14:17:59,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:17:59,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1465053042, now seen corresponding path program 5 times [2024-10-14 14:17:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185675154] [2024-10-14 14:17:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:17:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185675154] [2024-10-14 14:17:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185675154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038708487] [2024-10-14 14:17:59,854 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 14:17:59,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:59,855 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) [2024-10-14 14:17:59,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 14:17:59,912 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-14 14:17:59,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:17:59,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:17:59,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:00,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038708487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:00,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-10-14 14:18:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946906367] [2024-10-14 14:18:00,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 14:18:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 14:18:00,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 14:18:00,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:00,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 215 transitions, 4157 flow. Second operand has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:00,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:00,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:00,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:01,940 INFO L124 PetriNetUnfolderBase]: 2704/5162 cut-off events. [2024-10-14 14:18:01,940 INFO L125 PetriNetUnfolderBase]: For 548902/548908 co-relation queries the response was YES. [2024-10-14 14:18:01,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43935 conditions, 5162 events. 2704/5162 cut-off events. For 548902/548908 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 29002 event pairs, 1013 based on Foata normal form. 69/5230 useless extension candidates. Maximal degree in co-relation 43827. Up to 3618 conditions per place. [2024-10-14 14:18:01,980 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 261 selfloop transitions, 45 changer transitions 95/404 dead transitions. [2024-10-14 14:18:01,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 404 transitions, 9623 flow [2024-10-14 14:18:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 14:18:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-10-14 14:18:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 385 transitions. [2024-10-14 14:18:01,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-10-14 14:18:01,981 INFO L175 Difference]: Start difference. First operand has 233 places, 215 transitions, 4157 flow. Second operand 33 states and 385 transitions. [2024-10-14 14:18:01,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 404 transitions, 9623 flow [2024-10-14 14:18:02,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 404 transitions, 7126 flow, removed 1227 selfloop flow, removed 17 redundant places. [2024-10-14 14:18:02,758 INFO L231 Difference]: Finished difference. Result has 252 places, 231 transitions, 3701 flow [2024-10-14 14:18:02,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3701, PETRI_PLACES=252, PETRI_TRANSITIONS=231} [2024-10-14 14:18:02,759 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 226 predicate places. [2024-10-14 14:18:02,759 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 231 transitions, 3701 flow [2024-10-14 14:18:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:02,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:02,760 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:02,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 14:18:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:02,960 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -427535638, now seen corresponding path program 6 times [2024-10-14 14:18:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509399367] [2024-10-14 14:18:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:18:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509399367] [2024-10-14 14:18:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509399367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:18:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886806280] [2024-10-14 14:18:03,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 14:18:03,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:03,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:18:03,300 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) [2024-10-14 14:18:03,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 14:18:03,350 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-10-14 14:18:03,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:18:03,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:18:03,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:03,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886806280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:03,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-10-14 14:18:03,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570579459] [2024-10-14 14:18:03,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:03,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 14:18:03,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:03,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 14:18:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 14:18:03,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:03,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 231 transitions, 3701 flow. Second operand has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:03,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:03,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:03,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:05,769 INFO L124 PetriNetUnfolderBase]: 3208/6315 cut-off events. [2024-10-14 14:18:05,770 INFO L125 PetriNetUnfolderBase]: For 534394/534400 co-relation queries the response was YES. [2024-10-14 14:18:05,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47945 conditions, 6315 events. 3208/6315 cut-off events. For 534394/534400 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 37832 event pairs, 596 based on Foata normal form. 69/6383 useless extension candidates. Maximal degree in co-relation 47832. Up to 2398 conditions per place. [2024-10-14 14:18:05,819 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 265 selfloop transitions, 165 changer transitions 135/568 dead transitions. [2024-10-14 14:18:05,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 568 transitions, 10808 flow [2024-10-14 14:18:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-14 14:18:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-10-14 14:18:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 614 transitions. [2024-10-14 14:18:05,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4827044025157233 [2024-10-14 14:18:05,822 INFO L175 Difference]: Start difference. First operand has 252 places, 231 transitions, 3701 flow. Second operand 53 states and 614 transitions. [2024-10-14 14:18:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 568 transitions, 10808 flow [2024-10-14 14:18:06,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 568 transitions, 10049 flow, removed 354 selfloop flow, removed 21 redundant places. [2024-10-14 14:18:06,744 INFO L231 Difference]: Finished difference. Result has 295 places, 287 transitions, 4983 flow [2024-10-14 14:18:06,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3284, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4983, PETRI_PLACES=295, PETRI_TRANSITIONS=287} [2024-10-14 14:18:06,744 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 269 predicate places. [2024-10-14 14:18:06,745 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 287 transitions, 4983 flow [2024-10-14 14:18:06,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:06,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:06,745 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:06,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 14:18:06,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:06,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:06,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:06,946 INFO L85 PathProgramCache]: Analyzing trace with hash 739609620, now seen corresponding path program 7 times [2024-10-14 14:18:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967928162] [2024-10-14 14:18:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:07,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:18:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967928162] [2024-10-14 14:18:07,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967928162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:18:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001557838] [2024-10-14 14:18:07,278 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-14 14:18:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:18:07,279 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) [2024-10-14 14:18:07,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 14:18:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:07,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:18:07,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:07,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001557838] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:07,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-10-14 14:18:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824401845] [2024-10-14 14:18:07,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:07,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-14 14:18:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-14 14:18:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 14:18:07,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:07,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 287 transitions, 4983 flow. Second operand has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:07,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:07,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:07,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:10,622 INFO L124 PetriNetUnfolderBase]: 4099/8332 cut-off events. [2024-10-14 14:18:10,622 INFO L125 PetriNetUnfolderBase]: For 905406/905412 co-relation queries the response was YES. [2024-10-14 14:18:10,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70190 conditions, 8332 events. 4099/8332 cut-off events. For 905406/905412 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 54612 event pairs, 288 based on Foata normal form. 87/8418 useless extension candidates. Maximal degree in co-relation 70064. Up to 1947 conditions per place. [2024-10-14 14:18:10,702 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 239 selfloop transitions, 309 changer transitions 157/708 dead transitions. [2024-10-14 14:18:10,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 708 transitions, 15141 flow [2024-10-14 14:18:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-14 14:18:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-10-14 14:18:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 694 transitions. [2024-10-14 14:18:10,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4901129943502825 [2024-10-14 14:18:10,707 INFO L175 Difference]: Start difference. First operand has 295 places, 287 transitions, 4983 flow. Second operand 59 states and 694 transitions. [2024-10-14 14:18:10,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 708 transitions, 15141 flow [2024-10-14 14:18:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 708 transitions, 13664 flow, removed 640 selfloop flow, removed 29 redundant places. [2024-10-14 14:18:12,463 INFO L231 Difference]: Finished difference. Result has 340 places, 384 transitions, 7386 flow [2024-10-14 14:18:12,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4222, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7386, PETRI_PLACES=340, PETRI_TRANSITIONS=384} [2024-10-14 14:18:12,464 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 314 predicate places. [2024-10-14 14:18:12,464 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 384 transitions, 7386 flow [2024-10-14 14:18:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:12,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:12,464 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:12,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 14:18:12,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 14:18:12,665 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:12,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash 39792594, now seen corresponding path program 8 times [2024-10-14 14:18:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:12,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591034877] [2024-10-14 14:18:12,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:18:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591034877] [2024-10-14 14:18:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591034877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:18:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371944049] [2024-10-14 14:18:12,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 14:18:12,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:12,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:18:12,938 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) [2024-10-14 14:18:12,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 14:18:12,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 14:18:12,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:18:12,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:18:12,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:13,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371944049] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:13,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:13,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-10-14 14:18:13,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084364951] [2024-10-14 14:18:13,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:13,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 14:18:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 14:18:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 14:18:13,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:13,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 384 transitions, 7386 flow. Second operand has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:13,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:13,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:13,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:16,694 INFO L124 PetriNetUnfolderBase]: 5143/10444 cut-off events. [2024-10-14 14:18:16,694 INFO L125 PetriNetUnfolderBase]: For 1551652/1551658 co-relation queries the response was YES. [2024-10-14 14:18:16,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97699 conditions, 10444 events. 5143/10444 cut-off events. For 1551652/1551658 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 72171 event pairs, 150 based on Foata normal form. 87/10530 useless extension candidates. Maximal degree in co-relation 97556. Up to 2499 conditions per place. [2024-10-14 14:18:16,789 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 222 selfloop transitions, 422 changer transitions 157/804 dead transitions. [2024-10-14 14:18:16,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 804 transitions, 18543 flow [2024-10-14 14:18:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-14 14:18:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-10-14 14:18:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 704 transitions. [2024-10-14 14:18:16,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2024-10-14 14:18:16,791 INFO L175 Difference]: Start difference. First operand has 340 places, 384 transitions, 7386 flow. Second operand 59 states and 704 transitions. [2024-10-14 14:18:16,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 804 transitions, 18543 flow [2024-10-14 14:18:19,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 804 transitions, 15884 flow, removed 1181 selfloop flow, removed 31 redundant places. [2024-10-14 14:18:19,632 INFO L231 Difference]: Finished difference. Result has 384 places, 480 transitions, 9434 flow [2024-10-14 14:18:19,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5931, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9434, PETRI_PLACES=384, PETRI_TRANSITIONS=480} [2024-10-14 14:18:19,633 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 358 predicate places. [2024-10-14 14:18:19,633 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 480 transitions, 9434 flow [2024-10-14 14:18:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.121951219512195) internal successors, (292), 41 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:19,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:19,633 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:19,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 14:18:19,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 14:18:19,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:19,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2146966046, now seen corresponding path program 9 times [2024-10-14 14:18:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150503999] [2024-10-14 14:18:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:18:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150503999] [2024-10-14 14:18:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150503999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:18:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658252023] [2024-10-14 14:18:20,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 14:18:20,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:20,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:18:20,099 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) [2024-10-14 14:18:20,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 14:18:20,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-14 14:18:20,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:18:20,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:18:20,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:20,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658252023] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:20,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-10-14 14:18:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408632317] [2024-10-14 14:18:20,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-14 14:18:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-14 14:18:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 14:18:20,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:20,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 480 transitions, 9434 flow. Second operand has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:20,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:20,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:20,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:24,506 INFO L124 PetriNetUnfolderBase]: 5917/11880 cut-off events. [2024-10-14 14:18:24,507 INFO L125 PetriNetUnfolderBase]: For 2030900/2030906 co-relation queries the response was YES. [2024-10-14 14:18:24,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117443 conditions, 11880 events. 5917/11880 cut-off events. For 2030900/2030906 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 83621 event pairs, 66 based on Foata normal form. 96/11975 useless extension candidates. Maximal degree in co-relation 117282. Up to 2811 conditions per place. [2024-10-14 14:18:24,627 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 215 selfloop transitions, 495 changer transitions 162/875 dead transitions. [2024-10-14 14:18:24,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 875 transitions, 21133 flow [2024-10-14 14:18:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-14 14:18:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2024-10-14 14:18:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 727 transitions. [2024-10-14 14:18:24,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5048611111111111 [2024-10-14 14:18:24,629 INFO L175 Difference]: Start difference. First operand has 384 places, 480 transitions, 9434 flow. Second operand 60 states and 727 transitions. [2024-10-14 14:18:24,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 875 transitions, 21133 flow [2024-10-14 14:18:29,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 875 transitions, 18581 flow, removed 1090 selfloop flow, removed 34 redundant places. [2024-10-14 14:18:29,379 INFO L231 Difference]: Finished difference. Result has 424 places, 540 transitions, 11119 flow [2024-10-14 14:18:29,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7796, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=11119, PETRI_PLACES=424, PETRI_TRANSITIONS=540} [2024-10-14 14:18:29,380 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 398 predicate places. [2024-10-14 14:18:29,380 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 540 transitions, 11119 flow [2024-10-14 14:18:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.142857142857143) internal successors, (300), 42 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:29,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:29,380 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:29,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 14:18:29,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 14:18:29,584 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:29,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 794305653, now seen corresponding path program 10 times [2024-10-14 14:18:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011687870] [2024-10-14 14:18:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:18:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011687870] [2024-10-14 14:18:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011687870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:18:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769566385] [2024-10-14 14:18:29,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 14:18:29,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:18:29,847 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) [2024-10-14 14:18:29,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 14:18:29,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 14:18:29,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:18:29,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 14:18:29,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:29,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769566385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:30,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2024-10-14 14:18:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739774535] [2024-10-14 14:18:30,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:30,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-14 14:18:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-14 14:18:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 14:18:30,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:30,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 540 transitions, 11119 flow. Second operand has 43 states, 43 states have (on average 7.1395348837209305) internal successors, (307), 43 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:30,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:30,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:30,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:33,925 INFO L124 PetriNetUnfolderBase]: 6052/12223 cut-off events. [2024-10-14 14:18:33,925 INFO L125 PetriNetUnfolderBase]: For 2561735/2561741 co-relation queries the response was YES. [2024-10-14 14:18:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127916 conditions, 12223 events. 6052/12223 cut-off events. For 2561735/2561741 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 86715 event pairs, 203 based on Foata normal form. 33/12253 useless extension candidates. Maximal degree in co-relation 127740. Up to 2865 conditions per place. [2024-10-14 14:18:34,073 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 226 selfloop transitions, 479 changer transitions 87/795 dead transitions. [2024-10-14 14:18:34,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 795 transitions, 19462 flow [2024-10-14 14:18:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-14 14:18:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-10-14 14:18:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 524 transitions. [2024-10-14 14:18:34,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2024-10-14 14:18:34,075 INFO L175 Difference]: Start difference. First operand has 424 places, 540 transitions, 11119 flow. Second operand 43 states and 524 transitions. [2024-10-14 14:18:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 795 transitions, 19462 flow [2024-10-14 14:18:39,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 795 transitions, 15997 flow, removed 1429 selfloop flow, removed 42 redundant places. [2024-10-14 14:18:39,523 INFO L231 Difference]: Finished difference. Result has 421 places, 558 transitions, 10908 flow [2024-10-14 14:18:39,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9076, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=10908, PETRI_PLACES=421, PETRI_TRANSITIONS=558} [2024-10-14 14:18:39,524 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 395 predicate places. [2024-10-14 14:18:39,524 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 558 transitions, 10908 flow [2024-10-14 14:18:39,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.1395348837209305) internal successors, (307), 43 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:39,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:39,524 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:39,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 14:18:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 14:18:39,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:39,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2079276827, now seen corresponding path program 11 times [2024-10-14 14:18:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547934127] [2024-10-14 14:18:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:18:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:18:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547934127] [2024-10-14 14:18:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547934127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:18:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156054565] [2024-10-14 14:18:39,938 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 14:18:39,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:18:39,940 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) [2024-10-14 14:18:39,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 14:18:39,989 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-14 14:18:39,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 14:18:39,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 14:18:39,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:18:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:40,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:18:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 14:18:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156054565] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:18:40,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:18:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2024-10-14 14:18:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060241347] [2024-10-14 14:18:40,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:18:40,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-14 14:18:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:18:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-14 14:18:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1495, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 14:18:40,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-14 14:18:40,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 558 transitions, 10908 flow. Second operand has 44 states, 44 states have (on average 7.113636363636363) internal successors, (313), 44 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:40,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:18:40,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-14 14:18:40,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:18:44,452 INFO L124 PetriNetUnfolderBase]: 6025/12180 cut-off events. [2024-10-14 14:18:44,452 INFO L125 PetriNetUnfolderBase]: For 2007512/2007518 co-relation queries the response was YES. [2024-10-14 14:18:44,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115548 conditions, 12180 events. 6025/12180 cut-off events. For 2007512/2007518 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 86385 event pairs, 152 based on Foata normal form. 51/12230 useless extension candidates. Maximal degree in co-relation 115374. Up to 2817 conditions per place. [2024-10-14 14:18:44,585 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 212 selfloop transitions, 492 changer transitions 101/808 dead transitions. [2024-10-14 14:18:44,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 808 transitions, 17939 flow [2024-10-14 14:18:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 14:18:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-10-14 14:18:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 546 transitions. [2024-10-14 14:18:44,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-10-14 14:18:44,587 INFO L175 Difference]: Start difference. First operand has 421 places, 558 transitions, 10908 flow. Second operand 45 states and 546 transitions. [2024-10-14 14:18:44,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 808 transitions, 17939 flow [2024-10-14 14:18:48,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 808 transitions, 16312 flow, removed 658 selfloop flow, removed 24 redundant places. [2024-10-14 14:18:48,912 INFO L231 Difference]: Finished difference. Result has 444 places, 561 transitions, 11397 flow [2024-10-14 14:18:48,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=10069, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=11397, PETRI_PLACES=444, PETRI_TRANSITIONS=561} [2024-10-14 14:18:48,912 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 418 predicate places. [2024-10-14 14:18:48,912 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 561 transitions, 11397 flow [2024-10-14 14:18:48,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 7.113636363636363) internal successors, (313), 44 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:18:48,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:18:48,913 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:18:48,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 14:18:49,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:18:49,113 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-14 14:18:49,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:18:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash 656074616, now seen corresponding path program 12 times [2024-10-14 14:18:49,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:18:49,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473213122] [2024-10-14 14:18:49,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:18:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:18:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:18:49,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:18:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:18:49,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:18:49,152 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:18:49,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-14 14:18:49,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-14 14:18:49,154 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-14 14:18:49,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 14:18:49,155 INFO L407 BasicCegarLoop]: Path program histogram: [12, 3, 2, 1, 1, 1] [2024-10-14 14:18:49,239 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 14:18:49,239 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:18:49,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:18:49 BasicIcfg [2024-10-14 14:18:49,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:18:49,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:18:49,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:18:49,247 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:18:49,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:17:48" (3/4) ... [2024-10-14 14:18:49,247 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 14:18:49,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 14:18:49,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:18:49,312 INFO L158 Benchmark]: Toolchain (without parser) took 61110.31ms. Allocated memory was 184.5MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 155.0MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-10-14 14:18:49,312 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:18:49,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.69ms. Allocated memory is still 184.5MB. Free memory was 155.0MB in the beginning and 133.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 14:18:49,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.64ms. Allocated memory is still 184.5MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:18:49,313 INFO L158 Benchmark]: Boogie Preprocessor took 35.03ms. Allocated memory is still 184.5MB. Free memory was 131.4MB in the beginning and 129.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:18:49,313 INFO L158 Benchmark]: RCFGBuilder took 328.50ms. Allocated memory is still 184.5MB. Free memory was 129.3MB in the beginning and 142.2MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 14:18:49,313 INFO L158 Benchmark]: TraceAbstraction took 60328.70ms. Allocated memory was 184.5MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 141.2MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-10-14 14:18:49,314 INFO L158 Benchmark]: Witness Printer took 65.37ms. Allocated memory is still 8.6GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 14:18:49,315 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.69ms. Allocated memory is still 184.5MB. Free memory was 155.0MB in the beginning and 133.5MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.64ms. Allocated memory is still 184.5MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.03ms. Allocated memory is still 184.5MB. Free memory was 131.4MB in the beginning and 129.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.50ms. Allocated memory is still 184.5MB. Free memory was 129.3MB in the beginning and 142.2MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 60328.70ms. Allocated memory was 184.5MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 141.2MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 65.37ms. Allocated memory is still 8.6GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1=-2, id2=-1, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=9, k=9] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 60.2s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 49.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8138 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8115 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 439 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9068 IncrementalHoareTripleChecker+Invalid, 9507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 439 mSolverCounterUnsat, 9 mSDtfsCounter, 9068 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1851 GetRequests, 982 SyntacticMatches, 0 SemanticMatches, 869 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17971 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11397occurred in iteration=19, InterpolantAutomatonStates: 576, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 1793 ConstructedInterpolants, 0 QuantifiedInterpolants, 8038 SizeOfPredicates, 160 NumberOfNonLiveVariables, 1678 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 43 InterpolantComputations, 7 PerfectInterpolantSequences, 60/4683 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 14:18:49,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE