./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:40:48,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:40:48,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:40:48,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:40:48,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:40:48,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:40:48,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:40:48,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:40:48,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:40:48,247 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:40:48,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:40:48,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:40:48,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:40:48,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:40:48,247 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:40:48,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:40:48,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:40:48,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:48,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:40:48,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:40:48,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:40:48,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:40:48,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:40:48,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:40:48,251 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2025-03-13 21:40:48,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:40:48,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:40:48,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:40:48,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:40:48,466 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:40:48,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-13 21:40:49,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52357e067/71b9c992031d4e9ba1acb635ad79ce27/FLAG8f9683577 [2025-03-13 21:40:49,800 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:40:49,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-13 21:40:49,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52357e067/71b9c992031d4e9ba1acb635ad79ce27/FLAG8f9683577 [2025-03-13 21:40:50,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52357e067/71b9c992031d4e9ba1acb635ad79ce27 [2025-03-13 21:40:50,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:40:50,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:40:50,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:50,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:40:50,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:40:50,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50, skipping insertion in model container [2025-03-13 21:40:50,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:40:50,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c[2721,2734] [2025-03-13 21:40:50,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:50,295 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:40:50,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c[2721,2734] [2025-03-13 21:40:50,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:50,327 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:40:50,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50 WrapperNode [2025-03-13 21:40:50,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:50,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:50,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:40:50,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:40:50,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,352 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-03-13 21:40:50,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:50,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:40:50,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:40:50,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:40:50,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,380 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:40:50,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:40:50,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:40:50,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:40:50,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:40:50,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (1/1) ... [2025-03-13 21:40:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:50,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:50,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:40:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:40:50,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:40:50,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:40:50,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:40:50,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:40:50,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:40:50,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:40:50,443 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:40:50,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:40:50,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:40:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:40:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:40:50,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:40:50,445 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:40:50,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:40:50,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:40:50,705 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:40:50,706 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:40:50,706 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:40:50,850 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:40:50,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:50 BoogieIcfgContainer [2025-03-13 21:40:50,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:40:50,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:40:50,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:40:50,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:40:50,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:40:50" (1/3) ... [2025-03-13 21:40:50,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc677b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:50, skipping insertion in model container [2025-03-13 21:40:50,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:50" (2/3) ... [2025-03-13 21:40:50,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc677b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:50, skipping insertion in model container [2025-03-13 21:40:50,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:50" (3/3) ... [2025-03-13 21:40:50,860 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-03-13 21:40:50,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:40:50,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:40:50,872 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:40:50,917 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:40:50,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-03-13 21:40:50,970 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-13 21:40:50,974 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:40:50,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-13 21:40:50,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-03-13 21:40:50,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2025-03-13 21:40:50,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:40:50,993 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;@4630a1bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:40:50,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:40:51,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:40:51,005 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-13 21:40:51,005 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:40:51,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:51,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:51,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1216866071, now seen corresponding path program 1 times [2025-03-13 21:40:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:51,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490466306] [2025-03-13 21:40:51,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:51,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:40:51,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:40:51,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:51,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:51,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:51,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490466306] [2025-03-13 21:40:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490466306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:40:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467529214] [2025-03-13 21:40:51,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:51,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:40:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:51,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:40:51,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:40:51,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:51,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:51,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:51,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:51,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:51,653 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-03-13 21:40:51,653 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-03-13 21:40:51,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5572 event pairs, 123 based on Foata normal form. 1/998 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-03-13 21:40:51,665 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-03-13 21:40:51,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-03-13 21:40:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:40:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:40:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-13 21:40:51,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-13 21:40:51,676 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2025-03-13 21:40:51,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-03-13 21:40:51,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:40:51,685 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-03-13 21:40:51,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-03-13 21:40:51,691 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-13 21:40:51,691 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-03-13 21:40:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:51,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:51,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:51,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:40:51,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:51,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 598977853, now seen corresponding path program 1 times [2025-03-13 21:40:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-03-13 21:40:51,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:51,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:51,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:51,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:51,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-03-13 21:40:51,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581900342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:51,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501026457] [2025-03-13 21:40:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:51,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:51,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:51,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:51,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:51,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:51,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:51,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:52,051 INFO L124 PetriNetUnfolderBase]: 1558/2015 cut-off events. [2025-03-13 21:40:52,051 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-03-13 21:40:52,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4991 conditions, 2015 events. 1558/2015 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6852 event pairs, 87 based on Foata normal form. 33/2026 useless extension candidates. Maximal degree in co-relation 1789. Up to 826 conditions per place. [2025-03-13 21:40:52,066 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 57 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2025-03-13 21:40:52,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 72 transitions, 353 flow [2025-03-13 21:40:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-13 21:40:52,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-13 21:40:52,069 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 106 transitions. [2025-03-13 21:40:52,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 72 transitions, 353 flow [2025-03-13 21:40:52,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 72 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:52,070 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-03-13 21:40:52,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-03-13 21:40:52,071 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-03-13 21:40:52,071 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-03-13 21:40:52,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:52,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:52,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:52,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:40:52,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:52,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash -352949280, now seen corresponding path program 1 times [2025-03-13 21:40:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752214614] [2025-03-13 21:40:52,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:52,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:52,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:52,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:52,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:52,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752214614] [2025-03-13 21:40:52,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752214614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:52,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586297911] [2025-03-13 21:40:52,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:52,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:52,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:40:52,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:52,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:52,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:52,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:52,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586297911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:52,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850071291] [2025-03-13 21:40:52,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:52,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:52,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:52,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:52,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:52,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:52,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:52,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:52,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:52,653 INFO L124 PetriNetUnfolderBase]: 1955/2594 cut-off events. [2025-03-13 21:40:52,654 INFO L125 PetriNetUnfolderBase]: For 2855/2855 co-relation queries the response was YES. [2025-03-13 21:40:52,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8080 conditions, 2594 events. 1955/2594 cut-off events. For 2855/2855 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10459 event pairs, 325 based on Foata normal form. 80/2666 useless extension candidates. Maximal degree in co-relation 4054. Up to 1294 conditions per place. [2025-03-13 21:40:52,666 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 89 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2025-03-13 21:40:52,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 102 transitions, 615 flow [2025-03-13 21:40:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-13 21:40:52,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7375 [2025-03-13 21:40:52,670 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 118 transitions. [2025-03-13 21:40:52,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 102 transitions, 615 flow [2025-03-13 21:40:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 102 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:52,677 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2025-03-13 21:40:52,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-03-13 21:40:52,678 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-13 21:40:52,678 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2025-03-13 21:40:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:52,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:52,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:52,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:52,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1287743352, now seen corresponding path program 1 times [2025-03-13 21:40:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-03-13 21:40:52,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:52,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:52,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:52,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:52,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700607121] [2025-03-13 21:40:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700607121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:52,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120604373] [2025-03-13 21:40:52,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:52,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:52,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:52,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:52,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:40:52,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:52,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:52,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:52,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:52,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:53,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:53,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120604373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:53,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540549883] [2025-03-13 21:40:53,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:53,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:53,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:53,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:53,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:53,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:53,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:53,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:53,445 INFO L124 PetriNetUnfolderBase]: 2070/2826 cut-off events. [2025-03-13 21:40:53,445 INFO L125 PetriNetUnfolderBase]: For 4598/4602 co-relation queries the response was YES. [2025-03-13 21:40:53,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10391 conditions, 2826 events. 2070/2826 cut-off events. For 4598/4602 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 12025 event pairs, 369 based on Foata normal form. 78/2876 useless extension candidates. Maximal degree in co-relation 4506. Up to 1205 conditions per place. [2025-03-13 21:40:53,467 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 77 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2025-03-13 21:40:53,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 92 transitions, 626 flow [2025-03-13 21:40:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-13 21:40:53,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-13 21:40:53,468 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 108 transitions. [2025-03-13 21:40:53,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 92 transitions, 626 flow [2025-03-13 21:40:53,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 626 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:53,475 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 266 flow [2025-03-13 21:40:53,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-03-13 21:40:53,476 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2025-03-13 21:40:53,476 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 266 flow [2025-03-13 21:40:53,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:53,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:53,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:53,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:40:53,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-13 21:40:53,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1087553704, now seen corresponding path program 2 times [2025-03-13 21:40:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:53,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125141333] [2025-03-13 21:40:53,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:53,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:53,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:53,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:53,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:53,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125141333] [2025-03-13 21:40:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125141333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930390953] [2025-03-13 21:40:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:53,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:53,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:53,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:53,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:53,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:53,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:53,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:53,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:54,045 INFO L124 PetriNetUnfolderBase]: 1802/2399 cut-off events. [2025-03-13 21:40:54,045 INFO L125 PetriNetUnfolderBase]: For 5794/5794 co-relation queries the response was YES. [2025-03-13 21:40:54,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 2399 events. 1802/2399 cut-off events. For 5794/5794 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9503 event pairs, 169 based on Foata normal form. 38/2435 useless extension candidates. Maximal degree in co-relation 6485. Up to 1032 conditions per place. [2025-03-13 21:40:54,059 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 100 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-13 21:40:54,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 116 transitions, 893 flow [2025-03-13 21:40:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-03-13 21:40:54,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-03-13 21:40:54,061 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 266 flow. Second operand 5 states and 115 transitions. [2025-03-13 21:40:54,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 116 transitions, 893 flow [2025-03-13 21:40:54,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 116 transitions, 864 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:54,071 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 316 flow [2025-03-13 21:40:54,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-13 21:40:54,073 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-03-13 21:40:54,073 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 316 flow [2025-03-13 21:40:54,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:54,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:54,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:40:54,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1469452629, now seen corresponding path program 1 times [2025-03-13 21:40:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057773489] [2025-03-13 21:40:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:54,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:54,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:54,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:54,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057773489] [2025-03-13 21:40:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057773489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:54,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:54,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:54,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733298876] [2025-03-13 21:40:54,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:54,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:54,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:54,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:54,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:54,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:54,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:54,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:54,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:54,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:54,334 INFO L124 PetriNetUnfolderBase]: 1750/2347 cut-off events. [2025-03-13 21:40:54,334 INFO L125 PetriNetUnfolderBase]: For 6848/6848 co-relation queries the response was YES. [2025-03-13 21:40:54,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10174 conditions, 2347 events. 1750/2347 cut-off events. For 6848/6848 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9647 event pairs, 139 based on Foata normal form. 52/2397 useless extension candidates. Maximal degree in co-relation 6806. Up to 1045 conditions per place. [2025-03-13 21:40:54,347 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 98 selfloop transitions, 8 changer transitions 2/113 dead transitions. [2025-03-13 21:40:54,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 113 transitions, 873 flow [2025-03-13 21:40:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-13 21:40:54,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2025-03-13 21:40:54,349 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 316 flow. Second operand 5 states and 113 transitions. [2025-03-13 21:40:54,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 113 transitions, 873 flow [2025-03-13 21:40:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 862 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:54,356 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 319 flow [2025-03-13 21:40:54,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-13 21:40:54,357 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-03-13 21:40:54,357 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 319 flow [2025-03-13 21:40:54,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:54,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:54,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:54,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:40:54,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:54,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash 126971924, now seen corresponding path program 2 times [2025-03-13 21:40:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-03-13 21:40:54,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:54,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:54,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:54,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:54,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:54,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:54,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-03-13 21:40:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168213108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:54,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:54,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904879573] [2025-03-13 21:40:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:54,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:54,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:54,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:54,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:54,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:54,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:54,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:54,616 INFO L124 PetriNetUnfolderBase]: 1577/2122 cut-off events. [2025-03-13 21:40:54,616 INFO L125 PetriNetUnfolderBase]: For 6150/6154 co-relation queries the response was YES. [2025-03-13 21:40:54,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9430 conditions, 2122 events. 1577/2122 cut-off events. For 6150/6154 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8065 event pairs, 91 based on Foata normal form. 32/2134 useless extension candidates. Maximal degree in co-relation 6421. Up to 864 conditions per place. [2025-03-13 21:40:54,630 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 88 selfloop transitions, 9 changer transitions 4/106 dead transitions. [2025-03-13 21:40:54,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 869 flow [2025-03-13 21:40:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-13 21:40:54,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-13 21:40:54,631 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 319 flow. Second operand 5 states and 106 transitions. [2025-03-13 21:40:54,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 869 flow [2025-03-13 21:40:54,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 836 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:54,638 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 323 flow [2025-03-13 21:40:54,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-03-13 21:40:54,639 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-03-13 21:40:54,639 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 323 flow [2025-03-13 21:40:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:54,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:54,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:40:54,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:54,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1553053289, now seen corresponding path program 2 times [2025-03-13 21:40:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066183867] [2025-03-13 21:40:54,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:54,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:54,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:54,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:54,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:54,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066183867] [2025-03-13 21:40:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066183867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:54,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839179127] [2025-03-13 21:40:54,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:54,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:54,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:54,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:40:54,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:54,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:54,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:54,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:54,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:54,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:54,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839179127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:54,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130621] [2025-03-13 21:40:54,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:54,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:54,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:54,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:54,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:54,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:54,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:54,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:55,133 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2025-03-13 21:40:55,133 INFO L125 PetriNetUnfolderBase]: For 5840/5844 co-relation queries the response was YES. [2025-03-13 21:40:55,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9473 conditions, 2072 events. 1515/2072 cut-off events. For 5840/5844 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8394 event pairs, 258 based on Foata normal form. 63/2115 useless extension candidates. Maximal degree in co-relation 5972. Up to 1124 conditions per place. [2025-03-13 21:40:55,143 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-03-13 21:40:55,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 865 flow [2025-03-13 21:40:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-13 21:40:55,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-03-13 21:40:55,145 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 323 flow. Second operand 5 states and 103 transitions. [2025-03-13 21:40:55,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 865 flow [2025-03-13 21:40:55,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 858 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:55,150 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 370 flow [2025-03-13 21:40:55,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-13 21:40:55,150 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2025-03-13 21:40:55,150 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 370 flow [2025-03-13 21:40:55,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:55,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:55,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:55,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:55,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:55,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -565021671, now seen corresponding path program 2 times [2025-03-13 21:40:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:55,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671508405] [2025-03-13 21:40:55,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:55,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:55,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:55,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:55,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671508405] [2025-03-13 21:40:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671508405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834959510] [2025-03-13 21:40:55,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:40:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:55,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:55,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:40:55,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-13 21:40:55,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:55,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:40:55,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:55,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:40:55,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:55,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834959510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:40:55,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:40:55,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-13 21:40:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176043827] [2025-03-13 21:40:55,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:40:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:55,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:55,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:40:55,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:55,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:55,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:40:55,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:55,767 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-03-13 21:40:55,767 INFO L125 PetriNetUnfolderBase]: For 6962/6962 co-relation queries the response was YES. [2025-03-13 21:40:55,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9764 conditions, 1987 events. 1447/1987 cut-off events. For 6962/6962 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8191 event pairs, 375 based on Foata normal form. 68/2047 useless extension candidates. Maximal degree in co-relation 8540. Up to 1150 conditions per place. [2025-03-13 21:40:55,778 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-03-13 21:40:55,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1140 flow [2025-03-13 21:40:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-13 21:40:55,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-03-13 21:40:55,779 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 370 flow. Second operand 5 states and 111 transitions. [2025-03-13 21:40:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1140 flow [2025-03-13 21:40:55,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 1099 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:55,787 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 408 flow [2025-03-13 21:40:55,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-03-13 21:40:55,788 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 35 predicate places. [2025-03-13 21:40:55,788 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 408 flow [2025-03-13 21:40:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:55,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:55,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:55,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:40:55,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:55,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:40:55,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1177605010, now seen corresponding path program 1 times [2025-03-13 21:40:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-13 21:40:55,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:55,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:40:56,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:40:56,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:56,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-13 21:40:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823142964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418223768] [2025-03-13 21:40:56,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:56,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:56,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:56,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:56,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:40:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:40:56,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:40:56,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:56,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:40:56,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:42:04,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:42:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418223768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:15,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-13 21:42:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483218784] [2025-03-13 21:42:15,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:15,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:42:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:42:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=168, Unknown=9, NotChecked=0, Total=240 [2025-03-13 21:42:15,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-13 21:42:15,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 408 flow. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:15,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:15,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-13 21:42:15,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:29,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:42:33,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []