./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:46:51,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:46:51,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:46:51,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:46:51,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:46:51,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:46:51,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:46:51,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:46:51,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:46:51,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:46:51,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:46:51,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:46:51,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:46:51,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:46:51,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:46:51,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:46:51,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:46:51,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:46:51,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:46:51,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:46:51,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:46:51,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:46:51,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:46:51,264 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-jdk21/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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2025-02-06 04:46:51,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:46:51,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:46:51,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:46:51,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:46:51,482 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:46:51,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-02-06 04:46:52,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/000b5ca40/63a5a0c16e57418782a90ddb1f910233/FLAG150cb6731 [2025-02-06 04:46:52,928 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:46:52,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-02-06 04:46:52,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/000b5ca40/63a5a0c16e57418782a90ddb1f910233/FLAG150cb6731 [2025-02-06 04:46:53,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/000b5ca40/63a5a0c16e57418782a90ddb1f910233 [2025-02-06 04:46:53,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:46:53,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:46:53,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:46:53,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:46:53,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:46:53,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a2567a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53, skipping insertion in model container [2025-02-06 04:46:53,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:46:53,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i[33026,33039] [2025-02-06 04:46:53,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:46:53,585 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:46:53,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i[33026,33039] [2025-02-06 04:46:53,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:46:53,662 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:46:53,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53 WrapperNode [2025-02-06 04:46:53,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:46:53,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:46:53,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:46:53,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:46:53,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,692 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-02-06 04:46:53,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:46:53,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:46:53,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:46:53,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:46:53,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,715 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-02-06 04:46:53,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:46:53,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:46:53,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:46:53,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:46:53,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (1/1) ... [2025-02-06 04:46:53,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:46:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:46:53,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:46:53,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:46:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:46:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-02-06 04:46:53,772 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-02-06 04:46:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-02-06 04:46:53,772 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-02-06 04:46:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:46:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:46:53,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:46:53,773 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:46:53,851 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:46:53,853 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:46:53,946 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:46:53,947 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:46:54,007 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:46:54,008 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:46:54,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:46:54 BoogieIcfgContainer [2025-02-06 04:46:54,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:46:54,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:46:54,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:46:54,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:46:54,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:46:53" (1/3) ... [2025-02-06 04:46:54,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16826690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:46:54, skipping insertion in model container [2025-02-06 04:46:54,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:46:53" (2/3) ... [2025-02-06 04:46:54,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16826690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:46:54, skipping insertion in model container [2025-02-06 04:46:54,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:46:54" (3/3) ... [2025-02-06 04:46:54,015 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2025-02-06 04:46:54,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:46:54,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-1.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-06 04:46:54,031 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:46:54,074 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:46:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-02-06 04:46:54,124 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-02-06 04:46:54,128 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:46:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-06 04:46:54,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-02-06 04:46:54,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 61 flow [2025-02-06 04:46:54,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:46:54,144 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;@4c7ee4ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:46:54,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:46:54,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:46:54,149 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-02-06 04:46:54,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:46:54,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:54,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:54,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:54,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:54,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1583119239, now seen corresponding path program 1 times [2025-02-06 04:46:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15122842] [2025-02-06 04:46:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:54,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:46:54,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:46:54,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:54,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15122842] [2025-02-06 04:46:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15122842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:46:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543129241] [2025-02-06 04:46:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:54,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:46:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:54,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:46:54,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:46:54,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-02-06 04:46:54,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 61 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:54,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:54,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-02-06 04:46:54,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:54,613 INFO L124 PetriNetUnfolderBase]: 211/450 cut-off events. [2025-02-06 04:46:54,613 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 04:46:54,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 450 events. 211/450 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2214 event pairs, 26 based on Foata normal form. 48/420 useless extension candidates. Maximal degree in co-relation 780. Up to 153 conditions per place. [2025-02-06 04:46:54,618 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-02-06 04:46:54,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 63 transitions, 261 flow [2025-02-06 04:46:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:46:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:46:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-02-06 04:46:54,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-02-06 04:46:54,628 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 61 flow. Second operand 7 states and 122 transitions. [2025-02-06 04:46:54,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 63 transitions, 261 flow [2025-02-06 04:46:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 63 transitions, 251 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:46:54,633 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 101 flow [2025-02-06 04:46:54,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-02-06 04:46:54,637 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-02-06 04:46:54,637 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 101 flow [2025-02-06 04:46:54,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:54,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:54,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:46:54,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:54,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1832025527, now seen corresponding path program 1 times [2025-02-06 04:46:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374374878] [2025-02-06 04:46:54,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:54,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:46:54,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:46:54,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:54,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374374878] [2025-02-06 04:46:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374374878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:46:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838239862] [2025-02-06 04:46:54,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:54,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:54,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:46:54,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:46:54,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:46:54,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:46:54,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:46:54,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:54,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:54,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:46:54,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:46:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:54,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:46:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838239862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:46:54,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:46:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-06 04:46:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824849835] [2025-02-06 04:46:54,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:46:54,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:46:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:54,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:46:54,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:46:55,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-02-06 04:46:55,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 101 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-02-06 04:46:55,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:55,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-02-06 04:46:55,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:55,259 INFO L124 PetriNetUnfolderBase]: 477/882 cut-off events. [2025-02-06 04:46:55,259 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-02-06 04:46:55,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 882 events. 477/882 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4478 event pairs, 56 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1928. Up to 338 conditions per place. [2025-02-06 04:46:55,264 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 68 selfloop transitions, 14 changer transitions 3/89 dead transitions. [2025-02-06 04:46:55,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 89 transitions, 432 flow [2025-02-06 04:46:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:46:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:46:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2025-02-06 04:46:55,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-02-06 04:46:55,266 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 101 flow. Second operand 9 states and 136 transitions. [2025-02-06 04:46:55,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 89 transitions, 432 flow [2025-02-06 04:46:55,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 89 transitions, 418 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 04:46:55,269 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 160 flow [2025-02-06 04:46:55,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-02-06 04:46:55,270 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2025-02-06 04:46:55,270 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 160 flow [2025-02-06 04:46:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-02-06 04:46:55,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:55,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:55,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:46:55,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:55,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 583391849, now seen corresponding path program 1 times [2025-02-06 04:46:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357539952] [2025-02-06 04:46:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:55,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:46:55,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:46:55,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357539952] [2025-02-06 04:46:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357539952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:46:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213946993] [2025-02-06 04:46:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:55,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:46:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:55,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:46:55,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:46:55,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-02-06 04:46:55,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-06 04:46:55,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:55,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-02-06 04:46:55,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:55,843 INFO L124 PetriNetUnfolderBase]: 425/915 cut-off events. [2025-02-06 04:46:55,845 INFO L125 PetriNetUnfolderBase]: For 921/935 co-relation queries the response was YES. [2025-02-06 04:46:55,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 915 events. 425/915 cut-off events. For 921/935 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5342 event pairs, 89 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 2136. Up to 298 conditions per place. [2025-02-06 04:46:55,849 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 70 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2025-02-06 04:46:55,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 610 flow [2025-02-06 04:46:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:46:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:46:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2025-02-06 04:46:55,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-06 04:46:55,852 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 160 flow. Second operand 7 states and 112 transitions. [2025-02-06 04:46:55,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 610 flow [2025-02-06 04:46:55,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 564 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-02-06 04:46:55,858 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2025-02-06 04:46:55,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-02-06 04:46:55,859 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2025-02-06 04:46:55,859 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2025-02-06 04:46:55,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02-06 04:46:55,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:55,860 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:55,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:46:55,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 958185863, now seen corresponding path program 2 times [2025-02-06 04:46:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068121070] [2025-02-06 04:46:55,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:46:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:55,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 04:46:55,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:46:55,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:46:55,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068121070] [2025-02-06 04:46:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068121070] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:46:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380570926] [2025-02-06 04:46:55,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:46:55,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:55,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:46:55,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:46:55,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:46:55,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 04:46:55,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:46:55,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:46:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:55,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:46:55,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:46:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:56,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:46:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380570926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:56,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:46:56,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-06 04:46:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026011670] [2025-02-06 04:46:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:56,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:46:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:56,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:46:56,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:46:56,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-02-06 04:46:56,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-02-06 04:46:56,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:56,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-02-06 04:46:56,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:56,215 INFO L124 PetriNetUnfolderBase]: 373/802 cut-off events. [2025-02-06 04:46:56,215 INFO L125 PetriNetUnfolderBase]: For 755/765 co-relation queries the response was YES. [2025-02-06 04:46:56,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 802 events. 373/802 cut-off events. For 755/765 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4525 event pairs, 85 based on Foata normal form. 26/754 useless extension candidates. Maximal degree in co-relation 2321. Up to 309 conditions per place. [2025-02-06 04:46:56,219 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 67 selfloop transitions, 13 changer transitions 6/94 dead transitions. [2025-02-06 04:46:56,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 611 flow [2025-02-06 04:46:56,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 04:46:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 04:46:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2025-02-06 04:46:56,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-02-06 04:46:56,220 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 208 flow. Second operand 10 states and 154 transitions. [2025-02-06 04:46:56,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 611 flow [2025-02-06 04:46:56,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 578 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 04:46:56,227 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 246 flow [2025-02-06 04:46:56,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-02-06 04:46:56,228 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2025-02-06 04:46:56,228 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 246 flow [2025-02-06 04:46:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-02-06 04:46:56,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:56,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:56,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:46:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:56,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:56,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash 905247519, now seen corresponding path program 1 times [2025-02-06 04:46:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684122435] [2025-02-06 04:46:56,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:56,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:46:56,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:46:56,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:56,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:56,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684122435] [2025-02-06 04:46:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684122435] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:46:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488875772] [2025-02-06 04:46:56,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:46:56,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:46:56,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:46:56,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:46:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:46:56,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:56,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:56,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:46:56,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:46:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:56,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:46:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488875772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:46:56,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:46:56,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-06 04:46:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14625148] [2025-02-06 04:46:56,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:46:56,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:46:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:56,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:46:56,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:46:56,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-02-06 04:46:56,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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-02-06 04:46:56,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:56,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-02-06 04:46:56,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:56,844 INFO L124 PetriNetUnfolderBase]: 437/925 cut-off events. [2025-02-06 04:46:56,845 INFO L125 PetriNetUnfolderBase]: For 1257/1275 co-relation queries the response was YES. [2025-02-06 04:46:56,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2871 conditions, 925 events. 437/925 cut-off events. For 1257/1275 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5330 event pairs, 94 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 2606. Up to 351 conditions per place. [2025-02-06 04:46:56,849 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 76 selfloop transitions, 15 changer transitions 1/100 dead transitions. [2025-02-06 04:46:56,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 761 flow [2025-02-06 04:46:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:46:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:46:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-02-06 04:46:56,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-06 04:46:56,850 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 246 flow. Second operand 9 states and 144 transitions. [2025-02-06 04:46:56,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 761 flow [2025-02-06 04:46:56,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 741 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-02-06 04:46:56,854 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 298 flow [2025-02-06 04:46:56,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-02-06 04:46:56,855 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2025-02-06 04:46:56,855 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 298 flow [2025-02-06 04:46:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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-02-06 04:46:56,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:56,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:56,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:46:57,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:57,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1053791232, now seen corresponding path program 1 times [2025-02-06 04:46:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608118125] [2025-02-06 04:46:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:57,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:46:57,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:46:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608118125] [2025-02-06 04:46:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608118125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:57,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:57,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:46:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194732344] [2025-02-06 04:46:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:57,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:46:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:57,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:46:57,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:46:57,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-02-06 04:46:57,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-06 04:46:57,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:57,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-02-06 04:46:57,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:57,230 INFO L124 PetriNetUnfolderBase]: 395/833 cut-off events. [2025-02-06 04:46:57,230 INFO L125 PetriNetUnfolderBase]: For 1439/1455 co-relation queries the response was YES. [2025-02-06 04:46:57,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 833 events. 395/833 cut-off events. For 1439/1455 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4565 event pairs, 115 based on Foata normal form. 12/772 useless extension candidates. Maximal degree in co-relation 2682. Up to 417 conditions per place. [2025-02-06 04:46:57,235 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 47 selfloop transitions, 12 changer transitions 1/67 dead transitions. [2025-02-06 04:46:57,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 545 flow [2025-02-06 04:46:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:46:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:46:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-02-06 04:46:57,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-02-06 04:46:57,237 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 298 flow. Second operand 6 states and 93 transitions. [2025-02-06 04:46:57,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 545 flow [2025-02-06 04:46:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 496 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 04:46:57,242 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 279 flow [2025-02-06 04:46:57,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-02-06 04:46:57,243 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2025-02-06 04:46:57,243 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 279 flow [2025-02-06 04:46:57,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-06 04:46:57,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:57,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:57,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:46:57,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1636490914, now seen corresponding path program 1 times [2025-02-06 04:46:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958598543] [2025-02-06 04:46:57,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:57,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:46:57,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:46:57,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958598543] [2025-02-06 04:46:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958598543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:57,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:57,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:46:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26702593] [2025-02-06 04:46:57,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:46:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:57,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:46:57,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:46:57,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-02-06 04:46:57,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-06 04:46:57,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:57,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-02-06 04:46:57,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:57,459 INFO L124 PetriNetUnfolderBase]: 409/876 cut-off events. [2025-02-06 04:46:57,459 INFO L125 PetriNetUnfolderBase]: For 1568/1594 co-relation queries the response was YES. [2025-02-06 04:46:57,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2930 conditions, 876 events. 409/876 cut-off events. For 1568/1594 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4877 event pairs, 123 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 2807. Up to 439 conditions per place. [2025-02-06 04:46:57,469 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 51 selfloop transitions, 12 changer transitions 2/72 dead transitions. [2025-02-06 04:46:57,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 551 flow [2025-02-06 04:46:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:46:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:46:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-02-06 04:46:57,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2025-02-06 04:46:57,474 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 279 flow. Second operand 6 states and 97 transitions. [2025-02-06 04:46:57,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 551 flow [2025-02-06 04:46:57,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 522 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 04:46:57,482 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 296 flow [2025-02-06 04:46:57,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-02-06 04:46:57,483 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2025-02-06 04:46:57,483 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 296 flow [2025-02-06 04:46:57,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-06 04:46:57,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:57,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:57,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:46:57,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2002128599, now seen corresponding path program 2 times [2025-02-06 04:46:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126452530] [2025-02-06 04:46:57,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:46:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:57,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 04:46:57,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:46:57,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:46:57,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126452530] [2025-02-06 04:46:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126452530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:46:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44732284] [2025-02-06 04:46:57,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:46:57,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:57,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:46:57,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:46:57,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:46:57,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 04:46:57,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:46:57,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:46:57,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:57,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:46:57,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:46:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:57,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:46:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44732284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:46:58,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:46:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-02-06 04:46:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849337528] [2025-02-06 04:46:58,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:46:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:46:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:58,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:46:58,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:46:58,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-02-06 04:46:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 296 flow. Second operand has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 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-02-06 04:46:58,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-02-06 04:46:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:58,804 INFO L124 PetriNetUnfolderBase]: 751/1392 cut-off events. [2025-02-06 04:46:58,804 INFO L125 PetriNetUnfolderBase]: For 2958/3010 co-relation queries the response was YES. [2025-02-06 04:46:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1392 events. 751/1392 cut-off events. For 2958/3010 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7702 event pairs, 127 based on Foata normal form. 0/1264 useless extension candidates. Maximal degree in co-relation 4610. Up to 375 conditions per place. [2025-02-06 04:46:58,811 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 106 selfloop transitions, 22 changer transitions 31/164 dead transitions. [2025-02-06 04:46:58,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 164 transitions, 1325 flow [2025-02-06 04:46:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:46:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:46:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2025-02-06 04:46:58,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-02-06 04:46:58,814 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 296 flow. Second operand 15 states and 216 transitions. [2025-02-06 04:46:58,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 164 transitions, 1325 flow [2025-02-06 04:46:58,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 164 transitions, 1284 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-06 04:46:58,822 INFO L231 Difference]: Finished difference. Result has 82 places, 52 transitions, 409 flow [2025-02-06 04:46:58,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=409, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2025-02-06 04:46:58,824 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-02-06 04:46:58,825 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 409 flow [2025-02-06 04:46:58,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 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-02-06 04:46:58,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:58,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:58,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:46:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 04:46:59,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:46:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 808358602, now seen corresponding path program 1 times [2025-02-06 04:46:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645281758] [2025-02-06 04:46:59,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:59,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:46:59,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:46:59,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:59,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:46:59,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:46:59,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:46:59,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:46:59,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:46:59,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:46:59,060 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:46:59,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:46:59,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-02-06 04:46:59,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:46:59,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-06 04:46:59,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-06 04:46:59,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:46:59,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:46:59,062 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-02-06 04:46:59,089 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:46:59,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:46:59,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:46:59 BasicIcfg [2025-02-06 04:46:59,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:46:59,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:46:59,097 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:46:59,101 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:46:59,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:46:54" (3/4) ... [2025-02-06 04:46:59,103 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:46:59,155 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-02-06 04:46:59,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:46:59,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:46:59,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:46:59,219 INFO L158 Benchmark]: Toolchain (without parser) took 5990.81ms. Allocated memory is still 201.3MB. Free memory was 157.2MB in the beginning and 112.3MB in the end (delta: 44.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-02-06 04:46:59,219 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 218.1MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:46:59,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.87ms. Allocated memory is still 201.3MB. Free memory was 156.8MB in the beginning and 137.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:46:59,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.71ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 135.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:46:59,220 INFO L158 Benchmark]: Boogie Preprocessor took 29.04ms. Allocated memory is still 201.3MB. Free memory was 135.4MB in the beginning and 134.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:46:59,220 INFO L158 Benchmark]: IcfgBuilder took 284.23ms. Allocated memory is still 201.3MB. Free memory was 133.7MB in the beginning and 113.3MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:46:59,220 INFO L158 Benchmark]: TraceAbstraction took 5087.13ms. Allocated memory is still 201.3MB. Free memory was 112.9MB in the beginning and 118.8MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:46:59,220 INFO L158 Benchmark]: Witness Printer took 118.53ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 112.3MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:46:59,221 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.16ms. Allocated memory is still 218.1MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.87ms. Allocated memory is still 201.3MB. Free memory was 156.8MB in the beginning and 137.2MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.71ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 135.4MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.04ms. Allocated memory is still 201.3MB. Free memory was 135.4MB in the beginning and 134.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 284.23ms. Allocated memory is still 201.3MB. Free memory was 133.7MB in the beginning and 113.3MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5087.13ms. Allocated memory is still 201.3MB. Free memory was 112.9MB in the beginning and 118.8MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 118.53ms. Allocated memory is still 201.3MB. Free memory was 118.8MB in the beginning and 112.3MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=1, expression=0, limit=1] [L753] 2 reach_error() VAL [\old(expression)=0, _N=1, expression=0, limit=1] - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 6 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: 5.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 762 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 761 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1428 IncrementalHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 5 mSDtfsCounter, 1428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=8, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 18 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 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-02-06 04:46:59,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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