./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:26:08,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:26:08,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:26:08,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:26:08,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:26:08,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:26:08,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:26:08,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:26:08,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:26:08,542 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:26:08,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:26:08,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:26:08,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:26:08,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:26:08,543 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:26:08,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:26:08,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:26:08,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:26:08,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:08,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:26:08,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:26:08,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:26:08,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:26:08,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:26:08,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:26:08,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-03-13 21:26:08,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:26:08,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:26:08,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:26:08,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:26:08,799 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:26:08,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-03-13 21:26:09,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87feb4df4/6e426d671c964c3ea4dbdf95400644aa/FLAG08b2abe61 [2025-03-13 21:26:10,241 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:26:10,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-03-13 21:26:10,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87feb4df4/6e426d671c964c3ea4dbdf95400644aa/FLAG08b2abe61 [2025-03-13 21:26:10,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87feb4df4/6e426d671c964c3ea4dbdf95400644aa [2025-03-13 21:26:10,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:26:10,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:26:10,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:10,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:26:10,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:26:10,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd8bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10, skipping insertion in model container [2025-03-13 21:26:10,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:26:10,526 WARN L250 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-2.i[30952,30965] [2025-03-13 21:26:10,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:10,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:26:10,573 WARN L250 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-2.i[30952,30965] [2025-03-13 21:26:10,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:26:10,598 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:26:10,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10 WrapperNode [2025-03-13 21:26:10,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:26:10,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:10,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:26:10,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:26:10,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,628 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-03-13 21:26:10,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:26:10,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:26:10,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:26:10,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:26:10,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,649 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]. [2025-03-13 21:26:10,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:26:10,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:26:10,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:26:10,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:26:10,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (1/1) ... [2025-03-13 21:26:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:26:10,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:10,690 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) [2025-03-13 21:26:10,693 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 [2025-03-13 21:26:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:26:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:26:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:26:10,712 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:26:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:26:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:26:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:26:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:26:10,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:26:10,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:26:10,713 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:26:10,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:26:10,809 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:26:10,934 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:26:10,935 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:26:10,935 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:26:11,036 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:26:11,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:11 BoogieIcfgContainer [2025-03-13 21:26:11,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:26:11,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:26:11,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:26:11,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:26:11,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:26:10" (1/3) ... [2025-03-13 21:26:11,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c47bef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:11, skipping insertion in model container [2025-03-13 21:26:11,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:26:10" (2/3) ... [2025-03-13 21:26:11,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c47bef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:26:11, skipping insertion in model container [2025-03-13 21:26:11,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:11" (3/3) ... [2025-03-13 21:26:11,048 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-03-13 21:26:11,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:26:11,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-13 21:26:11,063 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:26:11,102 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:26:11,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-03-13 21:26:11,143 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-13 21:26:11,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:11,149 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 3. Compared 24 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. [2025-03-13 21:26:11,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-03-13 21:26:11,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-03-13 21:26:11,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:26:11,174 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;@7f228cde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:26:11,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:26:11,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:26:11,182 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-13 21:26:11,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:26:11,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:11,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:11,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 341173780, now seen corresponding path program 1 times [2025-03-13 21:26:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918769907] [2025-03-13 21:26:11,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:11,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:26:11,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:26:11,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:11,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:11,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918769907] [2025-03-13 21:26:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918769907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:11,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:11,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:26:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612062957] [2025-03-13 21:26:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:11,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:26:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:11,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:26:11,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:26:11,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:11,531 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) [2025-03-13 21:26:11,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:11,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:11,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:11,748 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-03-13 21:26:11,748 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:26:11,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 540 events. 321/540 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2134 event pairs, 62 based on Foata normal form. 12/535 useless extension candidates. Maximal degree in co-relation 1042. Up to 221 conditions per place. [2025-03-13 21:26:11,752 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-03-13 21:26:11,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-03-13 21:26:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:26:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:26:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-13 21:26:11,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-13 21:26:11,762 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-03-13 21:26:11,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-03-13 21:26:11,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:11,766 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-03-13 21:26:11,768 INFO L262 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-03-13 21:26:11,770 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-13 21:26:11,770 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-03-13 21:26:11,771 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) [2025-03-13 21:26:11,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:11,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:11,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:26:11,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:11,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -26154638, now seen corresponding path program 1 times [2025-03-13 21:26:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342644659] [2025-03-13 21:26:11,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:11,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:11,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:11,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342644659] [2025-03-13 21:26:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342644659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:11,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:11,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:26:11,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235400272] [2025-03-13 21:26:11,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:11,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:26:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:11,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:26:11,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:26:11,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:11,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 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) [2025-03-13 21:26:11,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:11,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:12,154 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-03-13 21:26:12,154 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-03-13 21:26:12,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 687 events. 382/687 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2911 event pairs, 65 based on Foata normal form. 27/710 useless extension candidates. Maximal degree in co-relation 1570. Up to 246 conditions per place. [2025-03-13 21:26:12,161 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-03-13 21:26:12,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-03-13 21:26:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:26:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:26:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-13 21:26:12,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-13 21:26:12,164 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-03-13 21:26:12,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-03-13 21:26:12,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:12,167 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-03-13 21:26:12,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-03-13 21:26:12,168 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-13 21:26:12,168 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-03-13 21:26:12,168 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) [2025-03-13 21:26:12,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:12,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:12,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:26:12,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146738, now seen corresponding path program 2 times [2025-03-13 21:26:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931381080] [2025-03-13 21:26:12,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:12,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:26:12,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:26:12,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:12,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:12,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931381080] [2025-03-13 21:26:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931381080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:26:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036072472] [2025-03-13 21:26:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:26:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:12,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:26:12,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:26:12,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:12,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 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) [2025-03-13 21:26:12,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:12,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:12,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:12,458 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-03-13 21:26:12,458 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-03-13 21:26:12,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 603 events. 328/603 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2513 event pairs, 65 based on Foata normal form. 45/644 useless extension candidates. Maximal degree in co-relation 1711. Up to 234 conditions per place. [2025-03-13 21:26:12,463 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-03-13 21:26:12,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-03-13 21:26:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:26:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:26:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-13 21:26:12,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-03-13 21:26:12,465 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-03-13 21:26:12,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-03-13 21:26:12,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-13 21:26:12,470 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-03-13 21:26:12,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-13 21:26:12,471 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-13 21:26:12,471 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-03-13 21:26:12,471 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) [2025-03-13 21:26:12,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:12,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:12,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:26:12,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:12,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947173, now seen corresponding path program 1 times [2025-03-13 21:26:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:12,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028822765] [2025-03-13 21:26:12,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:26:12,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:26:12,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:12,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:12,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028822765] [2025-03-13 21:26:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028822765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:26:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080262559] [2025-03-13 21:26:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:12,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:26:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:12,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:26:12,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:26:12,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:12,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 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) [2025-03-13 21:26:12,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:12,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:12,796 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-03-13 21:26:12,797 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-03-13 21:26:12,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 612 events. 337/612 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2551 event pairs, 74 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 1911. Up to 237 conditions per place. [2025-03-13 21:26:12,800 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-03-13 21:26:12,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-03-13 21:26:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:26:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:26:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-13 21:26:12,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-13 21:26:12,801 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-03-13 21:26:12,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-03-13 21:26:12,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-13 21:26:12,811 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-03-13 21:26:12,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2025-03-13 21:26:12,812 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-03-13 21:26:12,813 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-03-13 21:26:12,813 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) [2025-03-13 21:26:12,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:12,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:12,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:26:12,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:12,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 765975209, now seen corresponding path program 2 times [2025-03-13 21:26:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:12,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306533623] [2025-03-13 21:26:12,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:12,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:26:12,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:26:12,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:12,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306533623] [2025-03-13 21:26:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306533623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:12,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:12,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:26:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455145418] [2025-03-13 21:26:12,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:26:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:12,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:26:12,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:26:12,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:12,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 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) [2025-03-13 21:26:12,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:12,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:12,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:13,123 INFO L124 PetriNetUnfolderBase]: 445/801 cut-off events. [2025-03-13 21:26:13,124 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2025-03-13 21:26:13,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 801 events. 445/801 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3459 event pairs, 59 based on Foata normal form. 27/823 useless extension candidates. Maximal degree in co-relation 2600. Up to 151 conditions per place. [2025-03-13 21:26:13,129 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 23 changer transitions 30/100 dead transitions. [2025-03-13 21:26:13,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 739 flow [2025-03-13 21:26:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:26:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:26:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-03-13 21:26:13,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-13 21:26:13,131 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 138 transitions. [2025-03-13 21:26:13,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 739 flow [2025-03-13 21:26:13,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 685 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-13 21:26:13,137 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 390 flow [2025-03-13 21:26:13,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-03-13 21:26:13,138 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-13 21:26:13,138 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 390 flow [2025-03-13 21:26:13,138 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) [2025-03-13 21:26:13,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:13,138 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:13,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:26:13,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:13,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1363386589, now seen corresponding path program 1 times [2025-03-13 21:26:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-13 21:26:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:13,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:13,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:13,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-13 21:26:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685446831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823646507] [2025-03-13 21:26:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:13,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:13,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:13,245 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) [2025-03-13 21:26:13,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:26:13,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:13,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:13,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:13,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:13,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:26:13,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:13,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823646507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:13,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-13 21:26:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029992708] [2025-03-13 21:26:13,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:26:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:13,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:26:13,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:26:13,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:13,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 390 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:13,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:13,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:13,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:13,877 INFO L124 PetriNetUnfolderBase]: 571/1050 cut-off events. [2025-03-13 21:26:13,877 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2025-03-13 21:26:13,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 1050 events. 571/1050 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4364 event pairs, 137 based on Foata normal form. 63/1109 useless extension candidates. Maximal degree in co-relation 4107. Up to 486 conditions per place. [2025-03-13 21:26:13,883 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 17 changer transitions 67/151 dead transitions. [2025-03-13 21:26:13,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 1346 flow [2025-03-13 21:26:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:26:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:26:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-03-13 21:26:13,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-13 21:26:13,884 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 390 flow. Second operand 19 states and 231 transitions. [2025-03-13 21:26:13,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 1346 flow [2025-03-13 21:26:13,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1267 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-13 21:26:13,894 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 521 flow [2025-03-13 21:26:13,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-03-13 21:26:13,894 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 62 predicate places. [2025-03-13 21:26:13,894 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 521 flow [2025-03-13 21:26:13,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:13,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:13,894 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:13,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:26:14,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:14,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587151, now seen corresponding path program 2 times [2025-03-13 21:26:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116462803] [2025-03-13 21:26:14,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:14,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:26:14,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:14,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:26:14,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116462803] [2025-03-13 21:26:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116462803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:26:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:26:14,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:26:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583530536] [2025-03-13 21:26:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:26:14,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:26:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:14,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:26:14,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:26:14,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:14,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 51 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:14,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:14,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:14,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:14,459 INFO L124 PetriNetUnfolderBase]: 652/1217 cut-off events. [2025-03-13 21:26:14,459 INFO L125 PetriNetUnfolderBase]: For 19130/19130 co-relation queries the response was YES. [2025-03-13 21:26:14,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6062 conditions, 1217 events. 652/1217 cut-off events. For 19130/19130 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5640 event pairs, 132 based on Foata normal form. 27/1240 useless extension candidates. Maximal degree in co-relation 6019. Up to 483 conditions per place. [2025-03-13 21:26:14,468 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 76 selfloop transitions, 23 changer transitions 31/133 dead transitions. [2025-03-13 21:26:14,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 1509 flow [2025-03-13 21:26:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:26:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:26:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-03-13 21:26:14,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-13 21:26:14,469 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 521 flow. Second operand 15 states and 187 transitions. [2025-03-13 21:26:14,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 1509 flow [2025-03-13 21:26:14,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1211 flow, removed 138 selfloop flow, removed 12 redundant places. [2025-03-13 21:26:14,487 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 583 flow [2025-03-13 21:26:14,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=583, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2025-03-13 21:26:14,487 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-13 21:26:14,487 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 583 flow [2025-03-13 21:26:14,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:14,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:14,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:26:14,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -744688911, now seen corresponding path program 3 times [2025-03-13 21:26:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-03-13 21:26:14,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:14,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:26:14,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:14,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:26:14,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-03-13 21:26:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729287909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210760876] [2025-03-13 21:26:14,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:14,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:14,603 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) [2025-03-13 21:26:14,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:26:14,634 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:26:14,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:26:14,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:26:14,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:14,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:26:14,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:14,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210760876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:14,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:14,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-13 21:26:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311802368] [2025-03-13 21:26:14,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:14,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:26:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:14,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:26:14,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:26:14,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:14,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 583 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:14,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:14,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:14,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:15,283 INFO L124 PetriNetUnfolderBase]: 814/1489 cut-off events. [2025-03-13 21:26:15,284 INFO L125 PetriNetUnfolderBase]: For 23715/23715 co-relation queries the response was YES. [2025-03-13 21:26:15,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7554 conditions, 1489 events. 814/1489 cut-off events. For 23715/23715 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6954 event pairs, 72 based on Foata normal form. 81/1566 useless extension candidates. Maximal degree in co-relation 7511. Up to 237 conditions per place. [2025-03-13 21:26:15,292 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 78 selfloop transitions, 45 changer transitions 81/207 dead transitions. [2025-03-13 21:26:15,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 207 transitions, 2402 flow [2025-03-13 21:26:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-13 21:26:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-13 21:26:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 308 transitions. [2025-03-13 21:26:15,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-13 21:26:15,294 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 583 flow. Second operand 25 states and 308 transitions. [2025-03-13 21:26:15,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 207 transitions, 2402 flow [2025-03-13 21:26:15,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 207 transitions, 2182 flow, removed 94 selfloop flow, removed 10 redundant places. [2025-03-13 21:26:15,323 INFO L231 Difference]: Finished difference. Result has 117 places, 69 transitions, 910 flow [2025-03-13 21:26:15,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=69} [2025-03-13 21:26:15,324 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 91 predicate places. [2025-03-13 21:26:15,324 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 69 transitions, 910 flow [2025-03-13 21:26:15,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:15,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:15,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:15,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:15,525 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,SelfDestructingSolverStorable7 [2025-03-13 21:26:15,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:15,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash 183631298, now seen corresponding path program 1 times [2025-03-13 21:26:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:15,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-03-13 21:26:15,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:15,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:26:15,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:26:15,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:15,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:15,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:15,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-03-13 21:26:15,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653311858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:15,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338344809] [2025-03-13 21:26:15,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:26:15,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:15,624 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) [2025-03-13 21:26:15,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:26:15,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:26:15,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:26:15,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:15,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:15,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:26:15,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:15,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338344809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:15,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-13 21:26:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954502785] [2025-03-13 21:26:15,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:15,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:26:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:15,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:26:15,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:26:15,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:15,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 69 transitions, 910 flow. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:15,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:15,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:15,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:16,468 INFO L124 PetriNetUnfolderBase]: 1129/2119 cut-off events. [2025-03-13 21:26:16,468 INFO L125 PetriNetUnfolderBase]: For 69281/69281 co-relation queries the response was YES. [2025-03-13 21:26:16,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13163 conditions, 2119 events. 1129/2119 cut-off events. For 69281/69281 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11353 event pairs, 70 based on Foata normal form. 72/2187 useless extension candidates. Maximal degree in co-relation 13107. Up to 400 conditions per place. [2025-03-13 21:26:16,505 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 90 selfloop transitions, 66 changer transitions 88/247 dead transitions. [2025-03-13 21:26:16,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 247 transitions, 3782 flow [2025-03-13 21:26:16,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-13 21:26:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-13 21:26:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-03-13 21:26:16,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-03-13 21:26:16,507 INFO L175 Difference]: Start difference. First operand has 117 places, 69 transitions, 910 flow. Second operand 28 states and 341 transitions. [2025-03-13 21:26:16,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 247 transitions, 3782 flow [2025-03-13 21:26:16,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 247 transitions, 3161 flow, removed 288 selfloop flow, removed 17 redundant places. [2025-03-13 21:26:16,566 INFO L231 Difference]: Finished difference. Result has 138 places, 97 transitions, 1499 flow [2025-03-13 21:26:16,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1499, PETRI_PLACES=138, PETRI_TRANSITIONS=97} [2025-03-13 21:26:16,566 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 112 predicate places. [2025-03-13 21:26:16,567 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 97 transitions, 1499 flow [2025-03-13 21:26:16,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:16,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:16,567 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:16,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:16,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:16,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:16,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1643456025, now seen corresponding path program 2 times [2025-03-13 21:26:16,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:16,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499794235] [2025-03-13 21:26:16,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:16,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:26:16,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:26:16,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499794235] [2025-03-13 21:26:16,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499794235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828550630] [2025-03-13 21:26:16,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:26:16,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:16,891 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) [2025-03-13 21:26:16,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:26:16,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:26:16,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:26:16,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:26:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:16,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:26:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:16,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828550630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:17,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-13 21:26:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588211842] [2025-03-13 21:26:17,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:17,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 21:26:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:17,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 21:26:17,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:26:17,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:17,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 97 transitions, 1499 flow. Second operand has 19 states, 19 states have (on average 7.105263157894737) internal successors, (135), 19 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:17,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:17,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:17,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:17,807 INFO L124 PetriNetUnfolderBase]: 1372/2604 cut-off events. [2025-03-13 21:26:17,807 INFO L125 PetriNetUnfolderBase]: For 133401/133401 co-relation queries the response was YES. [2025-03-13 21:26:17,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18223 conditions, 2604 events. 1372/2604 cut-off events. For 133401/133401 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14115 event pairs, 65 based on Foata normal form. 54/2653 useless extension candidates. Maximal degree in co-relation 18157. Up to 513 conditions per place. [2025-03-13 21:26:17,829 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 90 selfloop transitions, 94 changer transitions 75/262 dead transitions. [2025-03-13 21:26:17,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 262 transitions, 4732 flow [2025-03-13 21:26:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-13 21:26:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-13 21:26:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 319 transitions. [2025-03-13 21:26:17,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5112179487179487 [2025-03-13 21:26:17,831 INFO L175 Difference]: Start difference. First operand has 138 places, 97 transitions, 1499 flow. Second operand 26 states and 319 transitions. [2025-03-13 21:26:17,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 262 transitions, 4732 flow [2025-03-13 21:26:17,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 262 transitions, 3627 flow, removed 528 selfloop flow, removed 15 redundant places. [2025-03-13 21:26:17,949 INFO L231 Difference]: Finished difference. Result has 154 places, 121 transitions, 1889 flow [2025-03-13 21:26:17,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1889, PETRI_PLACES=154, PETRI_TRANSITIONS=121} [2025-03-13 21:26:17,949 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 128 predicate places. [2025-03-13 21:26:17,949 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 121 transitions, 1889 flow [2025-03-13 21:26:17,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.105263157894737) internal successors, (135), 19 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:17,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:17,950 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:17,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:26:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:18,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:18,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1211190236, now seen corresponding path program 3 times [2025-03-13 21:26:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128653824] [2025-03-13 21:26:18,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:18,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-03-13 21:26:18,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:26:18,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-13 21:26:18,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:26:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128653824] [2025-03-13 21:26:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128653824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:26:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628975189] [2025-03-13 21:26:18,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:26:18,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:26:18,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:26:18,303 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) [2025-03-13 21:26:18,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:26:18,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-03-13 21:26:18,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:26:18,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-13 21:26:18,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:26:18,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-13 21:26:18,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:26:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:18,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:26:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:26:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628975189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:26:18,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:26:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-03-13 21:26:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804999117] [2025-03-13 21:26:18,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:26:18,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 21:26:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:26:18,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 21:26:18,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:26:18,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-13 21:26:18,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 121 transitions, 1889 flow. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:18,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:26:18,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-13 21:26:18,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:26:19,358 INFO L124 PetriNetUnfolderBase]: 1696/3169 cut-off events. [2025-03-13 21:26:19,358 INFO L125 PetriNetUnfolderBase]: For 156819/156819 co-relation queries the response was YES. [2025-03-13 21:26:19,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22092 conditions, 3169 events. 1696/3169 cut-off events. For 156819/156819 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 17213 event pairs, 50 based on Foata normal form. 54/3219 useless extension candidates. Maximal degree in co-relation 22019. Up to 621 conditions per place. [2025-03-13 21:26:19,378 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 117 selfloop transitions, 120 changer transitions 91/331 dead transitions. [2025-03-13 21:26:19,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 331 transitions, 5776 flow [2025-03-13 21:26:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:26:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:26:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2025-03-13 21:26:19,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2025-03-13 21:26:19,380 INFO L175 Difference]: Start difference. First operand has 154 places, 121 transitions, 1889 flow. Second operand 34 states and 417 transitions. [2025-03-13 21:26:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 331 transitions, 5776 flow [2025-03-13 21:26:19,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 331 transitions, 4884 flow, removed 413 selfloop flow, removed 17 redundant places. [2025-03-13 21:26:19,591 INFO L231 Difference]: Finished difference. Result has 180 places, 145 transitions, 2474 flow [2025-03-13 21:26:19,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2474, PETRI_PLACES=180, PETRI_TRANSITIONS=145} [2025-03-13 21:26:19,591 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-03-13 21:26:19,592 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 145 transitions, 2474 flow [2025-03-13 21:26:19,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:26:19,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:26:19,593 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:26:19,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:26:19,793 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,SelfDestructingSolverStorable10 [2025-03-13 21:26:19,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:26:19,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:26:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 869486859, now seen corresponding path program 4 times [2025-03-13 21:26:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:26:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628514894] [2025-03-13 21:26:19,795 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:26:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:26:19,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:26:19,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:19,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:26:19,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:19,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:26:19,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:26:19,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:26:19,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:26:19,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:26:19,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:26:19,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:26:19,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-13 21:26:19,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-13 21:26:19,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-13 21:26:19,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:26:19,840 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2025-03-13 21:26:19,889 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:26:19,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:26:19,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:26:19 BasicIcfg [2025-03-13 21:26:19,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:26:19,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:26:19,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:26:19,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:26:19,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:26:11" (3/4) ... [2025-03-13 21:26:19,898 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:26:19,943 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-13 21:26:19,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:26:19,981 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:26:19,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:26:19,981 INFO L158 Benchmark]: Toolchain (without parser) took 9703.26ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 128.3MB in the beginning and 194.6MB in the end (delta: -66.4MB). Peak memory consumption was 141.6MB. Max. memory is 16.1GB. [2025-03-13 21:26:19,981 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:19,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.55ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 109.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:19,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.12ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:26:19,982 INFO L158 Benchmark]: Boogie Preprocessor took 32.80ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 106.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:26:19,982 INFO L158 Benchmark]: IcfgBuilder took 373.96ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 86.7MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:26:19,982 INFO L158 Benchmark]: TraceAbstraction took 8857.48ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 85.8MB in the beginning and 206.3MB in the end (delta: -120.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2025-03-13 21:26:19,982 INFO L158 Benchmark]: Witness Printer took 84.06ms. Allocated memory is still 377.5MB. Free memory was 206.3MB in the beginning and 194.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:26:19,985 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.55ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 109.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.12ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 107.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.80ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 106.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 373.96ms. Allocated memory is still 167.8MB. Free memory was 106.2MB in the beginning and 86.7MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8857.48ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 85.8MB in the beginning and 206.3MB in the end (delta: -120.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. * Witness Printer took 84.06ms. Allocated memory is still 377.5MB. Free memory was 206.3MB in the beginning and 194.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. 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=-1, j=6] [L696] 1 int k = 0; 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=-1, id2=0, 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] [L696] COND TRUE 1 k < 5 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] [L704] COND TRUE 2 k < 5 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] [L716] 0 int condI = i >= (2*5 +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=7, id1=-1, id2=0, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 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 < 5 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] [L696] COND TRUE 1 k < 5 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] [L704] COND TRUE 2 k < 5 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] [L696] COND TRUE 1 k < 5 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] [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 < 5 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] [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] [L696] COND TRUE 1 k < 5 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] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [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=4] [L719] 0 int condJ = j >= (2*5 +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=15, id1=-1, id2=0, j=16, k=4, k=4] [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=15, id1=-1, id2=0, j=16, k=4, k=4] [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=15, id1=-1, id2=0, j=16, k=4, k=4] - 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: 8.7s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1841 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1830 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3119 IncrementalHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 10 mSDtfsCounter, 3119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2474occurred in iteration=11, InterpolantAutomatonStates: 192, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1615 SizeOfPredicates, 29 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 1/132 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:26:20,000 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