./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/popl20-bad-threaded-sum-2.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 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:22:27,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:22:27,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:22:27,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:22:27,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:22:27,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:22:27,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:22:27,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:22:27,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:22:27,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:22:27,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:22:27,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:22:27,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:22:27,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:22:27,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:22:27,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:27,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:22:27,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:22:27,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:22:27,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:22:27,850 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 -> 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 [2025-03-04 02:22:28,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:22:28,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:22:28,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:22:28,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:22:28,089 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:22:28,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-03-04 02:22:29,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6648fad2/40eb0931556c4dca87f4adb54f141fc6/FLAG0fd7433fb [2025-03-04 02:22:29,428 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:22:29,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-03-04 02:22:29,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6648fad2/40eb0931556c4dca87f4adb54f141fc6/FLAG0fd7433fb [2025-03-04 02:22:29,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6648fad2/40eb0931556c4dca87f4adb54f141fc6 [2025-03-04 02:22:29,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:22:29,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:22:29,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:29,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:22:29,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:22:29,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf8b581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29, skipping insertion in model container [2025-03-04 02:22:29,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:22:29,638 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/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-03-04 02:22:29,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:29,651 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:22:29,669 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/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-03-04 02:22:29,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:29,685 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:22:29,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29 WrapperNode [2025-03-04 02:22:29,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:29,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:29,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:22:29,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:22:29,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,713 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-03-04 02:22:29,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:29,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:22:29,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:22:29,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:22:29,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,739 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-04 02:22:29,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:22:29,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:22:29,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:22:29,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:22:29,754 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (1/1) ... [2025-03-04 02:22:29,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:29,781 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-04 02:22:29,785 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-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:22:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:22:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:22:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:22:29,802 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:22:29,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:22:29,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:22:29,991 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:22:29,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:22:30,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:22:30,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:22:30,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:30 BoogieIcfgContainer [2025-03-04 02:22:30,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:22:30,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:22:30,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:22:30,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:22:30,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:22:29" (1/3) ... [2025-03-04 02:22:30,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db3e0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:30, skipping insertion in model container [2025-03-04 02:22:30,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:29" (2/3) ... [2025-03-04 02:22:30,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db3e0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:30, skipping insertion in model container [2025-03-04 02:22:30,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:30" (3/3) ... [2025-03-04 02:22:30,078 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-03-04 02:22:30,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:22:30,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:22:30,090 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:22:30,132 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:22:30,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 64 flow [2025-03-04 02:22:30,178 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-03-04 02:22:30,180 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:22:30,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-04 02:22:30,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 64 flow [2025-03-04 02:22:30,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2025-03-04 02:22:30,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:22:30,200 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;@1381f132, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:22:30,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:22:30,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:22:30,209 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-04 02:22:30,209 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:22:30,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:30,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:30,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 345480012, now seen corresponding path program 1 times [2025-03-04 02:22:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483677728] [2025-03-04 02:22:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:30,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:22:30,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:22:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:30,603 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-04 02:22:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483677728] [2025-03-04 02:22:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483677728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932360137] [2025-03-04 02:22:30,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:30,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:30,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-04 02:22:30,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:30,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:30,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-04 02:22:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:30,778 INFO L124 PetriNetUnfolderBase]: 120/236 cut-off events. [2025-03-04 02:22:30,778 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 02:22:30,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 236 events. 120/236 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 871 event pairs, 9 based on Foata normal form. 16/250 useless extension candidates. Maximal degree in co-relation 427. Up to 134 conditions per place. [2025-03-04 02:22:30,781 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 35 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-03-04 02:22:30,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 195 flow [2025-03-04 02:22:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-04 02:22:30,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.624 [2025-03-04 02:22:30,790 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 56 flow. Second operand 5 states and 78 transitions. [2025-03-04 02:22:30,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 195 flow [2025-03-04 02:22:30,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 46 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:30,795 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2025-03-04 02:22:30,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-03-04 02:22:30,801 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2025-03-04 02:22:30,801 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2025-03-04 02:22:30,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:30,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:30,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:30,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:22:30,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1096274318, now seen corresponding path program 1 times [2025-03-04 02:22:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:30,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786923970] [2025-03-04 02:22:30,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:30,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:22:30,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:22:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:30,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:22:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786923970] [2025-03-04 02:22:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786923970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:31,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:31,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304474353] [2025-03-04 02:22:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:31,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:31,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:31,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:31,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:31,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-04 02:22:31,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04 02:22:31,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:31,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-04 02:22:31,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:31,095 INFO L124 PetriNetUnfolderBase]: 146/290 cut-off events. [2025-03-04 02:22:31,095 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-04 02:22:31,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 290 events. 146/290 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1188 event pairs, 15 based on Foata normal form. 13/301 useless extension candidates. Maximal degree in co-relation 251. Up to 144 conditions per place. [2025-03-04 02:22:31,098 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 02:22:31,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 243 flow [2025-03-04 02:22:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:22:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:22:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-04 02:22:31,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:22:31,099 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 4 states and 60 transitions. [2025-03-04 02:22:31,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 243 flow [2025-03-04 02:22:31,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:31,100 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2025-03-04 02:22:31,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-03-04 02:22:31,101 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-03-04 02:22:31,101 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2025-03-04 02:22:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04 02:22:31,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:31,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:31,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:22:31,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1467486481, now seen corresponding path program 1 times [2025-03-04 02:22:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986065896] [2025-03-04 02:22:31,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:31,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:22:31,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:22:31,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:31,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:31,264 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-04 02:22:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986065896] [2025-03-04 02:22:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986065896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:31,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357315378] [2025-03-04 02:22:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:31,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:31,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:31,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:31,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-04 02:22:31,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-04 02:22:31,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:31,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-04 02:22:31,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:31,365 INFO L124 PetriNetUnfolderBase]: 156/301 cut-off events. [2025-03-04 02:22:31,365 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-03-04 02:22:31,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 301 events. 156/301 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1221 event pairs, 23 based on Foata normal form. 16/315 useless extension candidates. Maximal degree in co-relation 364. Up to 109 conditions per place. [2025-03-04 02:22:31,369 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 34 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2025-03-04 02:22:31,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 253 flow [2025-03-04 02:22:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:22:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:22:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-04 02:22:31,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-03-04 02:22:31,370 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 5 states and 73 transitions. [2025-03-04 02:22:31,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 253 flow [2025-03-04 02:22:31,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:22:31,372 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 150 flow [2025-03-04 02:22:31,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-03-04 02:22:31,374 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2025-03-04 02:22:31,375 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 150 flow [2025-03-04 02:22:31,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-04 02:22:31,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:31,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:31,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:22:31,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:31,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2051951255, now seen corresponding path program 2 times [2025-03-04 02:22:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228403105] [2025-03-04 02:22:31,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:31,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:31,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:22:31,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:22:31,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:22:31,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:31,880 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-04 02:22:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228403105] [2025-03-04 02:22:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228403105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:22:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379487622] [2025-03-04 02:22:31,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:22:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:31,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:22:31,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:31,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-04 02:22:31,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-04 02:22:31,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:31,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-04 02:22:31,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:32,148 INFO L124 PetriNetUnfolderBase]: 241/455 cut-off events. [2025-03-04 02:22:32,149 INFO L125 PetriNetUnfolderBase]: For 551/551 co-relation queries the response was YES. [2025-03-04 02:22:32,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 455 events. 241/455 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1905 event pairs, 14 based on Foata normal form. 1/454 useless extension candidates. Maximal degree in co-relation 556. Up to 262 conditions per place. [2025-03-04 02:22:32,152 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 41 selfloop transitions, 14 changer transitions 9/69 dead transitions. [2025-03-04 02:22:32,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 420 flow [2025-03-04 02:22:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:22:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:22:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2025-03-04 02:22:32,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524 [2025-03-04 02:22:32,154 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 150 flow. Second operand 10 states and 131 transitions. [2025-03-04 02:22:32,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 420 flow [2025-03-04 02:22:32,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:32,157 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 241 flow [2025-03-04 02:22:32,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-04 02:22:32,158 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2025-03-04 02:22:32,158 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 241 flow [2025-03-04 02:22:32,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-04 02:22:32,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:32,158 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] [2025-03-04 02:22:32,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:22:32,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:32,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:32,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1869176617, now seen corresponding path program 1 times [2025-03-04 02:22:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:32,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407365057] [2025-03-04 02:22:32,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:32,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:32,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:32,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:32,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:32,348 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-04 02:22:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407365057] [2025-03-04 02:22:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407365057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669175164] [2025-03-04 02:22:32,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:32,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:32,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:32,353 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-04 02:22:32,354 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-04 02:22:32,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:32,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:32,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:32,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:32,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:22:32,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:32,509 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-04 02:22:32,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:32,611 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-04 02:22:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669175164] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:22:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 12 [2025-03-04 02:22:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827353027] [2025-03-04 02:22:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:22:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:32,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:22:32,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:22:32,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-03-04 02:22:32,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-04 02:22:32,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:32,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-03-04 02:22:32,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:32,932 INFO L124 PetriNetUnfolderBase]: 735/1246 cut-off events. [2025-03-04 02:22:32,933 INFO L125 PetriNetUnfolderBase]: For 2426/2426 co-relation queries the response was YES. [2025-03-04 02:22:32,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 1246 events. 735/1246 cut-off events. For 2426/2426 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5658 event pairs, 52 based on Foata normal form. 20/1265 useless extension candidates. Maximal degree in co-relation 4027. Up to 273 conditions per place. [2025-03-04 02:22:32,944 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 88 selfloop transitions, 37 changer transitions 0/128 dead transitions. [2025-03-04 02:22:32,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 128 transitions, 930 flow [2025-03-04 02:22:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:22:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:22:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2025-03-04 02:22:32,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490909090909091 [2025-03-04 02:22:32,947 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 241 flow. Second operand 11 states and 151 transitions. [2025-03-04 02:22:32,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 128 transitions, 930 flow [2025-03-04 02:22:32,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 128 transitions, 886 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-03-04 02:22:32,956 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 571 flow [2025-03-04 02:22:32,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=571, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2025-03-04 02:22:32,957 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 34 predicate places. [2025-03-04 02:22:32,957 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 571 flow [2025-03-04 02:22:32,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-04 02:22:32,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:32,958 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] [2025-03-04 02:22:32,964 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-04 02:22:33,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:33,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:33,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1548598755, now seen corresponding path program 2 times [2025-03-04 02:22:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:33,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210807918] [2025-03-04 02:22:33,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:22:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:33,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:33,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:33,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:22:33,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:33,639 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-04 02:22:33,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210807918] [2025-03-04 02:22:33,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210807918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:33,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:33,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:22:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559689891] [2025-03-04 02:22:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:33,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:22:33,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:33,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:22:33,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:22:33,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-04 02:22:33,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 571 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 02:22:33,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:33,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-04 02:22:33,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:34,044 INFO L124 PetriNetUnfolderBase]: 693/1322 cut-off events. [2025-03-04 02:22:34,044 INFO L125 PetriNetUnfolderBase]: For 6101/6111 co-relation queries the response was YES. [2025-03-04 02:22:34,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 1322 events. 693/1322 cut-off events. For 6101/6111 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6949 event pairs, 47 based on Foata normal form. 7/1319 useless extension candidates. Maximal degree in co-relation 4273. Up to 675 conditions per place. [2025-03-04 02:22:34,053 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 86 selfloop transitions, 31 changer transitions 13/143 dead transitions. [2025-03-04 02:22:34,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1299 flow [2025-03-04 02:22:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:22:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:22:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2025-03-04 02:22:34,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2025-03-04 02:22:34,055 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 571 flow. Second operand 12 states and 157 transitions. [2025-03-04 02:22:34,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1299 flow [2025-03-04 02:22:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 143 transitions, 1189 flow, removed 55 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:34,073 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 767 flow [2025-03-04 02:22:34,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=767, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2025-03-04 02:22:34,074 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 49 predicate places. [2025-03-04 02:22:34,074 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 767 flow [2025-03-04 02:22:34,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 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-04 02:22:34,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:34,075 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] [2025-03-04 02:22:34,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:22:34,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:34,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash -802914163, now seen corresponding path program 3 times [2025-03-04 02:22:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035357969] [2025-03-04 02:22:34,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:34,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:22:34,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:22:34,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:22:34,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:34,603 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-04 02:22:34,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035357969] [2025-03-04 02:22:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035357969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:22:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289152375] [2025-03-04 02:22:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:34,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:22:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:34,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:22:34,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:22:34,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-04 02:22:34,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 767 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-04 02:22:34,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:34,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-04 02:22:34,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:35,082 INFO L124 PetriNetUnfolderBase]: 764/1461 cut-off events. [2025-03-04 02:22:35,082 INFO L125 PetriNetUnfolderBase]: For 7017/7027 co-relation queries the response was YES. [2025-03-04 02:22:35,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 1461 events. 764/1461 cut-off events. For 7017/7027 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7847 event pairs, 53 based on Foata normal form. 7/1458 useless extension candidates. Maximal degree in co-relation 6045. Up to 816 conditions per place. [2025-03-04 02:22:35,091 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 91 selfloop transitions, 36 changer transitions 13/153 dead transitions. [2025-03-04 02:22:35,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 153 transitions, 1473 flow [2025-03-04 02:22:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:22:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:22:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2025-03-04 02:22:35,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-03-04 02:22:35,092 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 767 flow. Second operand 12 states and 152 transitions. [2025-03-04 02:22:35,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 153 transitions, 1473 flow [2025-03-04 02:22:35,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 153 transitions, 1427 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-04 02:22:35,105 INFO L231 Difference]: Finished difference. Result has 83 places, 107 transitions, 1035 flow [2025-03-04 02:22:35,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1035, PETRI_PLACES=83, PETRI_TRANSITIONS=107} [2025-03-04 02:22:35,107 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-03-04 02:22:35,107 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 1035 flow [2025-03-04 02:22:35,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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-04 02:22:35,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:35,107 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:35,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:22:35,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:35,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1039039716, now seen corresponding path program 3 times [2025-03-04 02:22:35,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392429004] [2025-03-04 02:22:35,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:35,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:22:35,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:22:35,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:35,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392429004] [2025-03-04 02:22:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392429004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005862480] [2025-03-04 02:22:35,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:22:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:35,589 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-04 02:22:35,595 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-04 02:22:35,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:22:35,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:22:35,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:22:35,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:35,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:22:35,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:35,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005862480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:36,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:36,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 02:22:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773026037] [2025-03-04 02:22:36,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:36,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:22:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:36,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:22:36,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:22:36,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-03-04 02:22:36,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 107 transitions, 1035 flow. Second operand has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 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-04 02:22:36,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:36,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-03-04 02:22:36,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:38,969 INFO L124 PetriNetUnfolderBase]: 1978/3570 cut-off events. [2025-03-04 02:22:38,969 INFO L125 PetriNetUnfolderBase]: For 21044/21044 co-relation queries the response was YES. [2025-03-04 02:22:38,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15310 conditions, 3570 events. 1978/3570 cut-off events. For 21044/21044 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21420 event pairs, 20 based on Foata normal form. 5/3573 useless extension candidates. Maximal degree in co-relation 15249. Up to 622 conditions per place. [2025-03-04 02:22:38,995 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 279 selfloop transitions, 217 changer transitions 36/536 dead transitions. [2025-03-04 02:22:38,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 536 transitions, 5290 flow [2025-03-04 02:22:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 02:22:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 02:22:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 577 transitions. [2025-03-04 02:22:38,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128888888888888 [2025-03-04 02:22:39,000 INFO L175 Difference]: Start difference. First operand has 83 places, 107 transitions, 1035 flow. Second operand 45 states and 577 transitions. [2025-03-04 02:22:39,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 536 transitions, 5290 flow [2025-03-04 02:22:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 536 transitions, 5241 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:22:39,058 INFO L231 Difference]: Finished difference. Result has 144 places, 278 transitions, 3384 flow [2025-03-04 02:22:39,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=3384, PETRI_PLACES=144, PETRI_TRANSITIONS=278} [2025-03-04 02:22:39,060 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 117 predicate places. [2025-03-04 02:22:39,061 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 278 transitions, 3384 flow [2025-03-04 02:22:39,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 23 states have internal predecessors, (192), 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-04 02:22:39,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:39,062 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:39,068 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-04 02:22:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 02:22:39,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash -232601808, now seen corresponding path program 4 times [2025-03-04 02:22:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-03-04 02:22:39,264 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:39,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:22:39,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:22:39,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:22:39,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:39,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168715053] [2025-03-04 02:22:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168715053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:39,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:39,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:22:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733298876] [2025-03-04 02:22:39,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:39,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:22:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:22:39,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:22:39,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-03-04 02:22:39,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 278 transitions, 3384 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:39,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:39,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-03-04 02:22:39,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:39,926 INFO L124 PetriNetUnfolderBase]: 2538/4477 cut-off events. [2025-03-04 02:22:39,926 INFO L125 PetriNetUnfolderBase]: For 63185/63333 co-relation queries the response was YES. [2025-03-04 02:22:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23665 conditions, 4477 events. 2538/4477 cut-off events. For 63185/63333 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 27455 event pairs, 5 based on Foata normal form. 128/4582 useless extension candidates. Maximal degree in co-relation 23590. Up to 1152 conditions per place. [2025-03-04 02:22:39,965 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 446 selfloop transitions, 141 changer transitions 0/631 dead transitions. [2025-03-04 02:22:39,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 631 transitions, 9379 flow [2025-03-04 02:22:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:22:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:22:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2025-03-04 02:22:39,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-03-04 02:22:39,967 INFO L175 Difference]: Start difference. First operand has 144 places, 278 transitions, 3384 flow. Second operand 9 states and 111 transitions. [2025-03-04 02:22:39,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 631 transitions, 9379 flow [2025-03-04 02:22:40,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 631 transitions, 8068 flow, removed 588 selfloop flow, removed 13 redundant places. [2025-03-04 02:22:40,112 INFO L231 Difference]: Finished difference. Result has 141 places, 376 transitions, 4652 flow [2025-03-04 02:22:40,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4652, PETRI_PLACES=141, PETRI_TRANSITIONS=376} [2025-03-04 02:22:40,114 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 114 predicate places. [2025-03-04 02:22:40,114 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 376 transitions, 4652 flow [2025-03-04 02:22:40,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:22:40,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:40,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:22:40,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:22:40,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:22:40,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1649450673, now seen corresponding path program 4 times [2025-03-04 02:22:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-03-04 02:22:40,117 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:40,121 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:22:40,169 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:22:40,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:22:40,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:44,220 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-04 02:22:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168213108] [2025-03-04 02:22:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168213108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:22:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098093403] [2025-03-04 02:22:44,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:22:44,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:22:44,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:44,224 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-04 02:22:44,225 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-04 02:22:44,252 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:22:44,270 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:22:44,271 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:22:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:44,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:22:44,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:22:48,946 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-04 02:22:48,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:22:59,899 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-04 02:22:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098093403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:22:59,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:22:59,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 02:22:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913256433] [2025-03-04 02:22:59,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:22:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:22:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:59,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:22:59,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=464, Unknown=3, NotChecked=0, Total=600 [2025-03-04 02:22:59,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-03-04 02:22:59,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 376 transitions, 4652 flow. Second operand has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 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-04 02:22:59,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:59,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-03-04 02:22:59,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:03,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:23:16,492 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 67 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 02:23:18,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:23:20,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:23:24,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:23:29,291 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 [] [2025-03-04 02:23:43,141 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 [] [2025-03-04 02:23:44,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 02:24:01,197 WARN L286 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 53 DAG size of output: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 02:24:03,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []