./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.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-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:37:20,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:37:20,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:37:20,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:37:20,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:37:20,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:37:20,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:37:20,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:37:20,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:37:20,399 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:37:20,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:37:20,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:37:20,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:37:20,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:37:20,399 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:37:20,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:37:20,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:37:20,401 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:37:20,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:37:20,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:37:20,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:37:20,402 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-03-13 21:37:20,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:37:20,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:37:20,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:37:20,630 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:37:20,630 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:37:20,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-03-13 21:37:21,758 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab733318/0fda19fbbe9d4fcc8332540925d59fac/FLAG83481c7a4 [2025-03-13 21:37:22,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:37:22,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-03-13 21:37:22,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab733318/0fda19fbbe9d4fcc8332540925d59fac/FLAG83481c7a4 [2025-03-13 21:37:22,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab733318/0fda19fbbe9d4fcc8332540925d59fac [2025-03-13 21:37:22,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:37:22,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:37:22,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:37:22,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:37:22,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:37:22,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9f10cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22, skipping insertion in model container [2025-03-13 21:37:22,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:37:22,196 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-03-13 21:37:22,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:37:22,394 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:37:22,403 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-03-13 21:37:22,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:37:22,497 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:37:22,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22 WrapperNode [2025-03-13 21:37:22,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:37:22,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:37:22,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:37:22,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:37:22,505 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:37:22" (1/1) ... [2025-03-13 21:37:22,522 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:37:22" (1/1) ... [2025-03-13 21:37:22,535 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-03-13 21:37:22,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:37:22,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:37:22,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:37:22,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:37:22,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,552 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:37:22,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:37:22,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:37:22,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:37:22,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:37:22,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (1/1) ... [2025-03-13 21:37:22,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:37:22,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:22,587 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:37:22,590 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:37:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:37:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:37:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-03-13 21:37:22,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-03-13 21:37:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:37:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:37:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:37:22,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:37:22,606 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:37:22,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:37:22,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:37:22,856 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:37:22,857 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:37:22,857 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:37:23,137 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:37:23,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:37:23 BoogieIcfgContainer [2025-03-13 21:37:23,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:37:23,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:37:23,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:37:23,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:37:23,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:37:22" (1/3) ... [2025-03-13 21:37:23,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c536a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:37:23, skipping insertion in model container [2025-03-13 21:37:23,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:37:22" (2/3) ... [2025-03-13 21:37:23,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c536a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:37:23, skipping insertion in model container [2025-03-13 21:37:23,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:37:23" (3/3) ... [2025-03-13 21:37:23,146 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-03-13 21:37:23,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:37:23,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-13 21:37:23,160 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:37:23,197 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 21:37:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2025-03-13 21:37:23,247 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-03-13 21:37:23,251 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:37:23,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 21 events. 3/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-03-13 21:37:23,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2025-03-13 21:37:23,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2025-03-13 21:37:23,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:37:23,272 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;@3411426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:37:23,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-13 21:37:23,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:37:23,282 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-13 21:37:23,282 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:37:23,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:23,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:23,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 6986012, now seen corresponding path program 1 times [2025-03-13 21:37:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955092931] [2025-03-13 21:37:23,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:23,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:37:23,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:37:23,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:23,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:23,532 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:37:23,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955092931] [2025-03-13 21:37:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955092931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:37:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775458915] [2025-03-13 21:37:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:23,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:37:23,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:23,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:37:23,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:37:23,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-03-13 21:37:23,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:37:23,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:23,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-03-13 21:37:23,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:23,619 INFO L124 PetriNetUnfolderBase]: 37/88 cut-off events. [2025-03-13 21:37:23,619 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:37:23,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 88 events. 37/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 271 event pairs, 15 based on Foata normal form. 6/93 useless extension candidates. Maximal degree in co-relation 154. Up to 53 conditions per place. [2025-03-13 21:37:23,621 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-03-13 21:37:23,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 102 flow [2025-03-13 21:37:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:37:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:37:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-13 21:37:23,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-13 21:37:23,629 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 41 transitions. [2025-03-13 21:37:23,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 26 transitions, 102 flow [2025-03-13 21:37:23,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 26 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:37:23,635 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2025-03-13 21:37:23,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-03-13 21:37:23,640 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-03-13 21:37:23,640 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2025-03-13 21:37:23,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:37:23,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:23,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:37:23,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:23,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1232125357, now seen corresponding path program 1 times [2025-03-13 21:37:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:23,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605169073] [2025-03-13 21:37:23,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:23,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:37:23,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:37:23,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:23,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:37:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605169073] [2025-03-13 21:37:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605169073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:37:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:37:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:37:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593728738] [2025-03-13 21:37:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:37:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:37:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:23,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:37:23,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:37:23,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-03-13 21:37:23,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:37:23,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:23,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-03-13 21:37:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:23,773 INFO L124 PetriNetUnfolderBase]: 51/121 cut-off events. [2025-03-13 21:37:23,773 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-13 21:37:23,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 121 events. 51/121 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 367 event pairs, 20 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 65. Up to 65 conditions per place. [2025-03-13 21:37:23,774 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-13 21:37:23,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 27 transitions, 118 flow [2025-03-13 21:37:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:37:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:37:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-13 21:37:23,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-13 21:37:23,775 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 42 transitions. [2025-03-13 21:37:23,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 27 transitions, 118 flow [2025-03-13 21:37:23,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:37:23,776 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2025-03-13 21:37:23,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-03-13 21:37:23,777 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2025-03-13 21:37:23,777 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2025-03-13 21:37:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:37:23,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:23,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:37:23,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1294827575, now seen corresponding path program 1 times [2025-03-13 21:37:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030431152] [2025-03-13 21:37:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:23,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:37:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:37:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:23,904 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:37:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030431152] [2025-03-13 21:37:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030431152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:37:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385748268] [2025-03-13 21:37:23,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:37:23,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:23,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:23,908 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:37:23,910 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:37:24,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:37:24,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:37:24,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:24,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:24,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:37:24,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:37:24,099 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:37:24,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:37:24,131 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:37:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385748268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:37:24,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:37:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-13 21:37:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39774056] [2025-03-13 21:37:24,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:37:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:37:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:24,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:37:24,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:37:24,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-03-13 21:37:24,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:37:24,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:24,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-03-13 21:37:24,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:24,263 INFO L124 PetriNetUnfolderBase]: 116/242 cut-off events. [2025-03-13 21:37:24,263 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-13 21:37:24,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 242 events. 116/242 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 725 event pairs, 8 based on Foata normal form. 15/257 useless extension candidates. Maximal degree in co-relation 139. Up to 69 conditions per place. [2025-03-13 21:37:24,268 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 41 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-03-13 21:37:24,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 51 transitions, 244 flow [2025-03-13 21:37:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:37:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:37:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2025-03-13 21:37:24,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-13 21:37:24,270 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 6 states and 81 transitions. [2025-03-13 21:37:24,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 51 transitions, 244 flow [2025-03-13 21:37:24,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:37:24,272 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 98 flow [2025-03-13 21:37:24,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-03-13 21:37:24,272 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-03-13 21:37:24,272 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 98 flow [2025-03-13 21:37:24,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:37:24,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:24,274 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:24,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:37:24,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:24,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:24,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1178774699, now seen corresponding path program 2 times [2025-03-13 21:37:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337206988] [2025-03-13 21:37:24,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:37:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:24,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:37:24,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:37:24,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:37:24,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-13 21:37:24,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337206988] [2025-03-13 21:37:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337206988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:37:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872442407] [2025-03-13 21:37:24,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:37:24,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:24,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:24,586 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:37:24,587 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:37:24,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:37:24,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:37:24,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:37:24,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:24,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:37:24,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:37:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:37:24,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:37:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:37:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872442407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:37:24,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:37:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-13 21:37:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714965061] [2025-03-13 21:37:24,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:37:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:37:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:24,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:37:24,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:37:24,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-03-13 21:37:24,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 98 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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:37:24,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:24,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-03-13 21:37:24,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:25,319 INFO L124 PetriNetUnfolderBase]: 425/872 cut-off events. [2025-03-13 21:37:25,320 INFO L125 PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES. [2025-03-13 21:37:25,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2430 conditions, 872 events. 425/872 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3284 event pairs, 6 based on Foata normal form. 101/973 useless extension candidates. Maximal degree in co-relation 682. Up to 213 conditions per place. [2025-03-13 21:37:25,326 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 182 selfloop transitions, 69 changer transitions 0/254 dead transitions. [2025-03-13 21:37:25,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 254 transitions, 1446 flow [2025-03-13 21:37:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:37:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:37:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 450 transitions. [2025-03-13 21:37:25,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016042780748663 [2025-03-13 21:37:25,328 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 98 flow. Second operand 34 states and 450 transitions. [2025-03-13 21:37:25,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 254 transitions, 1446 flow [2025-03-13 21:37:25,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 254 transitions, 1386 flow, removed 27 selfloop flow, removed 1 redundant places. [2025-03-13 21:37:25,336 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 730 flow [2025-03-13 21:37:25,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=730, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-03-13 21:37:25,337 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2025-03-13 21:37:25,337 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 730 flow [2025-03-13 21:37:25,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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:37:25,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:25,337 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:25,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:37:25,538 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,SelfDestructingSolverStorable3 [2025-03-13 21:37:25,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1290235184, now seen corresponding path program 3 times [2025-03-13 21:37:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813872079] [2025-03-13 21:37:25,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:37:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:25,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-03-13 21:37:25,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 66 statements. [2025-03-13 21:37:25,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:37:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 21:37:25,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:25,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813872079] [2025-03-13 21:37:25,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813872079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:37:25,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279500515] [2025-03-13 21:37:25,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:37:25,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:25,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:25,641 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:37:25,642 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:37:25,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-03-13 21:37:25,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 66 statements. [2025-03-13 21:37:25,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-13 21:37:25,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:25,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:37:25,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:37:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 21:37:25,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:37:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 21:37:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279500515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:37:25,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:37:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-13 21:37:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462030829] [2025-03-13 21:37:25,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:37:25,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 21:37:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:25,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 21:37:25,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:37:25,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-03-13 21:37:25,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 730 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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:37:25,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:25,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-03-13 21:37:25,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:26,142 INFO L124 PetriNetUnfolderBase]: 919/1953 cut-off events. [2025-03-13 21:37:26,142 INFO L125 PetriNetUnfolderBase]: For 28272/28290 co-relation queries the response was YES. [2025-03-13 21:37:26,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8925 conditions, 1953 events. 919/1953 cut-off events. For 28272/28290 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 9055 event pairs, 184 based on Foata normal form. 196/2112 useless extension candidates. Maximal degree in co-relation 7745. Up to 343 conditions per place. [2025-03-13 21:37:26,160 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 122 selfloop transitions, 38 changer transitions 0/167 dead transitions. [2025-03-13 21:37:26,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 167 transitions, 1870 flow [2025-03-13 21:37:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:37:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:37:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-03-13 21:37:26,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2025-03-13 21:37:26,165 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 730 flow. Second operand 8 states and 111 transitions. [2025-03-13 21:37:26,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 167 transitions, 1870 flow [2025-03-13 21:37:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 167 transitions, 1784 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-13 21:37:26,197 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 866 flow [2025-03-13 21:37:26,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2025-03-13 21:37:26,199 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2025-03-13 21:37:26,200 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 866 flow [2025-03-13 21:37:26,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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:37:26,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:26,200 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:26,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:37:26,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:26,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -628585232, now seen corresponding path program 4 times [2025-03-13 21:37:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146136283] [2025-03-13 21:37:26,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:37:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:26,423 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 78 statements into 2 equivalence classes. [2025-03-13 21:37:26,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 21:37:26,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:37:26,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-13 21:37:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146136283] [2025-03-13 21:37:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146136283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:37:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125130929] [2025-03-13 21:37:26,600 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:37:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:26,602 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:37:26,603 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:37:26,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 78 statements into 2 equivalence classes. [2025-03-13 21:37:26,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 21:37:26,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:37:26,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:26,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:37:26,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:37:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-13 21:37:26,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:37:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-13 21:37:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125130929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:37:26,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:37:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-13 21:37:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607108175] [2025-03-13 21:37:26,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:37:26,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:37:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:26,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:37:26,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:37:26,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-03-13 21:37:26,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 866 flow. Second operand has 16 states, 16 states have (on average 8.6875) internal successors, (139), 16 states have internal predecessors, (139), 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:37:26,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:26,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-03-13 21:37:26,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:27,444 INFO L124 PetriNetUnfolderBase]: 1973/4086 cut-off events. [2025-03-13 21:37:27,444 INFO L125 PetriNetUnfolderBase]: For 82505/82511 co-relation queries the response was YES. [2025-03-13 21:37:27,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21929 conditions, 4086 events. 1973/4086 cut-off events. For 82505/82511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 22144 event pairs, 230 based on Foata normal form. 392/4388 useless extension candidates. Maximal degree in co-relation 19151. Up to 783 conditions per place. [2025-03-13 21:37:27,484 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 258 selfloop transitions, 46 changer transitions 0/311 dead transitions. [2025-03-13 21:37:27,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 311 transitions, 3688 flow [2025-03-13 21:37:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:37:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:37:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 227 transitions. [2025-03-13 21:37:27,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6448863636363636 [2025-03-13 21:37:27,486 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 866 flow. Second operand 16 states and 227 transitions. [2025-03-13 21:37:27,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 311 transitions, 3688 flow [2025-03-13 21:37:27,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 311 transitions, 3524 flow, removed 60 selfloop flow, removed 2 redundant places. [2025-03-13 21:37:27,532 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 1088 flow [2025-03-13 21:37:27,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1088, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-03-13 21:37:27,534 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 98 predicate places. [2025-03-13 21:37:27,534 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 1088 flow [2025-03-13 21:37:27,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 16 states have internal predecessors, (139), 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:37:27,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:27,535 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:27,543 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:37:27,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:27,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:27,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1343031440, now seen corresponding path program 5 times [2025-03-13 21:37:27,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:27,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826515204] [2025-03-13 21:37:27,737 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:37:27,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:27,755 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 15 equivalence classes. [2025-03-13 21:37:27,778 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 21:37:27,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-13 21:37:27,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-13 21:37:28,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:28,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826515204] [2025-03-13 21:37:28,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826515204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:37:28,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270816892] [2025-03-13 21:37:28,012 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:37:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:28,014 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:37:28,015 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:37:28,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 15 equivalence classes. [2025-03-13 21:37:28,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 102 of 102 statements. [2025-03-13 21:37:28,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-13 21:37:28,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:28,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:37:28,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:37:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-13 21:37:28,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:37:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-13 21:37:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270816892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:37:28,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:37:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2025-03-13 21:37:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601834890] [2025-03-13 21:37:28,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:37:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 21:37:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:28,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 21:37:28,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-03-13 21:37:28,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-03-13 21:37:28,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 1088 flow. Second operand has 22 states, 22 states have (on average 10.954545454545455) internal successors, (241), 22 states have internal predecessors, (241), 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:37:28,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:28,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-03-13 21:37:28,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:29,554 INFO L124 PetriNetUnfolderBase]: 2997/6132 cut-off events. [2025-03-13 21:37:29,554 INFO L125 PetriNetUnfolderBase]: For 151058/151162 co-relation queries the response was YES. [2025-03-13 21:37:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32408 conditions, 6132 events. 2997/6132 cut-off events. For 151058/151162 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 36239 event pairs, 69 based on Foata normal form. 304/6430 useless extension candidates. Maximal degree in co-relation 30729. Up to 1545 conditions per place. [2025-03-13 21:37:29,611 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 471 selfloop transitions, 66 changer transitions 0/543 dead transitions. [2025-03-13 21:37:29,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 543 transitions, 9228 flow [2025-03-13 21:37:29,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 21:37:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 21:37:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 312 transitions. [2025-03-13 21:37:29,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6446280991735537 [2025-03-13 21:37:29,613 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 1088 flow. Second operand 22 states and 312 transitions. [2025-03-13 21:37:29,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 543 transitions, 9228 flow [2025-03-13 21:37:29,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 543 transitions, 8968 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:37:29,705 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 1588 flow [2025-03-13 21:37:29,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1588, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2025-03-13 21:37:29,707 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 125 predicate places. [2025-03-13 21:37:29,707 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 1588 flow [2025-03-13 21:37:29,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.954545454545455) internal successors, (241), 22 states have internal predecessors, (241), 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:37:29,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:29,707 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:29,761 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:37:29,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:29,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1577838658, now seen corresponding path program 6 times [2025-03-13 21:37:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826276032] [2025-03-13 21:37:29,909 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:37:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:29,925 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 21 equivalence classes. [2025-03-13 21:37:29,962 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 21:37:29,963 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-13 21:37:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-13 21:37:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:37:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826276032] [2025-03-13 21:37:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826276032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:37:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804266218] [2025-03-13 21:37:30,252 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:37:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:37:30,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:37:30,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:37:30,358 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 21 equivalence classes. [2025-03-13 21:37:30,436 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 152 of 152 statements. [2025-03-13 21:37:30,436 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-03-13 21:37:30,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:37:30,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:37:30,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:37:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-13 21:37:30,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:37:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-13 21:37:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804266218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:37:30,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:37:30,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 21:37:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732896688] [2025-03-13 21:37:30,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:37:30,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 21:37:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:37:30,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 21:37:30,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-13 21:37:30,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-03-13 21:37:30,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 1588 flow. Second operand has 23 states, 23 states have (on average 8.478260869565217) internal successors, (195), 23 states have internal predecessors, (195), 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:37:30,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:37:30,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-03-13 21:37:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:37:32,558 INFO L124 PetriNetUnfolderBase]: 5317/10818 cut-off events. [2025-03-13 21:37:32,558 INFO L125 PetriNetUnfolderBase]: For 228077/228250 co-relation queries the response was YES. [2025-03-13 21:37:32,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56478 conditions, 10818 events. 5317/10818 cut-off events. For 228077/228250 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 64468 event pairs, 378 based on Foata normal form. 707/11368 useless extension candidates. Maximal degree in co-relation 51564. Up to 1893 conditions per place. [2025-03-13 21:37:32,645 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 570 selfloop transitions, 52 changer transitions 0/632 dead transitions. [2025-03-13 21:37:32,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 632 transitions, 9270 flow [2025-03-13 21:37:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 21:37:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 21:37:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 309 transitions. [2025-03-13 21:37:32,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6384297520661157 [2025-03-13 21:37:32,647 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 1588 flow. Second operand 22 states and 309 transitions. [2025-03-13 21:37:32,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 632 transitions, 9270 flow [2025-03-13 21:37:32,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 632 transitions, 8892 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-13 21:37:32,790 INFO L231 Difference]: Finished difference. Result has 164 places, 138 transitions, 1832 flow [2025-03-13 21:37:32,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1832, PETRI_PLACES=164, PETRI_TRANSITIONS=138} [2025-03-13 21:37:32,791 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2025-03-13 21:37:32,791 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 138 transitions, 1832 flow [2025-03-13 21:37:32,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.478260869565217) internal successors, (195), 23 states have internal predecessors, (195), 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:37:32,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:37:32,791 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:37:32,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:37:32,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:37:32,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:37:32,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:37:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 245116442, now seen corresponding path program 7 times [2025-03-13 21:37:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:37:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574921078] [2025-03-13 21:37:32,993 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:37:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:37:33,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-13 21:37:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 21:37:33,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:33,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:37:33,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:37:33,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-13 21:37:33,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 21:37:33,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:37:33,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:37:33,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:37:33,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:37:33,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-13 21:37:33,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-13 21:37:33,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:37:33,185 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-03-13 21:37:33,291 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:37:33,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:37:33,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:37:33 BasicIcfg [2025-03-13 21:37:33,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:37:33,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:37:33,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:37:33,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:37:33,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:37:23" (3/4) ... [2025-03-13 21:37:33,299 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:37:33,383 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 47. [2025-03-13 21:37:33,436 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:37:33,437 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:37:33,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:37:33,437 INFO L158 Benchmark]: Toolchain (without parser) took 11383.65ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 112.5MB in the beginning and 236.2MB in the end (delta: -123.7MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. [2025-03-13 21:37:33,437 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:33,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.93ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 75.2MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 21:37:33,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.66ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 72.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:33,438 INFO L158 Benchmark]: Boogie Preprocessor took 22.98ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 70.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:37:33,438 INFO L158 Benchmark]: IcfgBuilder took 578.15ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 73.6MB in the end (delta: -3.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-03-13 21:37:33,438 INFO L158 Benchmark]: TraceAbstraction took 10157.62ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 72.8MB in the beginning and 257.2MB in the end (delta: -184.4MB). Peak memory consumption was 406.0MB. Max. memory is 16.1GB. [2025-03-13 21:37:33,438 INFO L158 Benchmark]: Witness Printer took 138.93ms. Allocated memory is still 545.3MB. Free memory was 257.2MB in the beginning and 236.2MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:37:33,440 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.93ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 75.2MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.66ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 72.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.98ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 70.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 578.15ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 73.6MB in the end (delta: -3.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10157.62ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 72.8MB in the beginning and 257.2MB in the end (delta: -184.4MB). Peak memory consumption was 406.0MB. Max. memory is 16.1GB. * Witness Printer took 138.93ms. Allocated memory is still 545.3MB. Free memory was 257.2MB in the beginning and 236.2MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=20, myglobal=20, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=33, myglobal=33, mythread=-1] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1342]: 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 3 procedures, 28 locations, 2 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: 10.0s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 854 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1120 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 9 mSDtfsCounter, 1120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 984 GetRequests, 871 SyntacticMatches, 12 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1832occurred in iteration=8, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1091 NumberOfCodeBlocks, 1011 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 1350 ConstructedInterpolants, 0 QuantifiedInterpolants, 3216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1327 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 4864/7057 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:37:33,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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