./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind2-nondet.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:51,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:51,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:57:51,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:51,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:51,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:51,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:51,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:51,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:51,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:51,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:51,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:51,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:51,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:51,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:51,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:51,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:51,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:51,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:51,573 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d [2025-01-10 06:57:51,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:51,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:51,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:51,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:51,791 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:51,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-01-10 06:57:53,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37edd16b9/23df9b74d14a416fb4f675451741357e/FLAGde444d440 [2025-01-10 06:57:53,361 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:53,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-01-10 06:57:53,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37edd16b9/23df9b74d14a416fb4f675451741357e/FLAGde444d440 [2025-01-10 06:57:53,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37edd16b9/23df9b74d14a416fb4f675451741357e [2025-01-10 06:57:53,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:53,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:53,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:53,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:53,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:53,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63171e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53, skipping insertion in model container [2025-01-10 06:57:53,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:53,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:53,894 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:53,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:53,955 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53 WrapperNode [2025-01-10 06:57:53,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:53,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:53,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:53,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:53,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,979 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 88 [2025-01-10 06:57:53,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:53,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:53,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:53,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:53,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:53,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,003 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-01-10 06:57:54,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:54,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:54,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:54,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:54,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (1/1) ... [2025-01-10 06:57:54,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:54,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:57:54,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:57:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:54,061 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:54,061 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:54,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:54,062 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:57:54,133 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:54,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:54,226 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:54,226 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:54,371 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:54,375 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:54,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:54 BoogieIcfgContainer [2025-01-10 06:57:54,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:54,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:54,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:54,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:54,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:53" (1/3) ... [2025-01-10 06:57:54,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bccd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:54, skipping insertion in model container [2025-01-10 06:57:54,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:53" (2/3) ... [2025-01-10 06:57:54,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bccd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:54, skipping insertion in model container [2025-01-10 06:57:54,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:54" (3/3) ... [2025-01-10 06:57:54,390 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-01-10 06:57:54,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:54,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-10 06:57:54,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:54,447 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:57:54,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 78 flow [2025-01-10 06:57:54,498 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-01-10 06:57:54,500 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:54,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 2/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-10 06:57:54,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 78 flow [2025-01-10 06:57:54,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 65 flow [2025-01-10 06:57:54,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:54,525 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;@73325780, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:54,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-10 06:57:54,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:54,531 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:57:54,531 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:57:54,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:54,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:57:54,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:54,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash -514364613, now seen corresponding path program 1 times [2025-01-10 06:57:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198318171] [2025-01-10 06:57:54,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:54,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:57:54,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:57:54,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:54,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198318171] [2025-01-10 06:57:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198318171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:54,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941564708] [2025-01-10 06:57:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:54,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:54,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:54,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:54,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-01-10 06:57:54,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:54,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:54,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:54,772 INFO L124 PetriNetUnfolderBase]: 123/294 cut-off events. [2025-01-10 06:57:54,773 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:57:54,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 294 events. 123/294 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1361 event pairs, 96 based on Foata normal form. 11/239 useless extension candidates. Maximal degree in co-relation 480. Up to 211 conditions per place. [2025-01-10 06:57:54,776 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 17 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-01-10 06:57:54,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 99 flow [2025-01-10 06:57:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 06:57:54,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 06:57:54,785 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 65 flow. Second operand 3 states and 52 transitions. [2025-01-10 06:57:54,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 99 flow [2025-01-10 06:57:54,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:54,790 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 60 flow [2025-01-10 06:57:54,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-01-10 06:57:54,793 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-01-10 06:57:54,794 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 60 flow [2025-01-10 06:57:54,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-01-10 06:57:54,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:54,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:54,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:54,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:54,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1234566474, now seen corresponding path program 1 times [2025-01-10 06:57:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894885283] [2025-01-10 06:57:54,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:54,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:54,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:54,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:54,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894885283] [2025-01-10 06:57:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894885283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966260828] [2025-01-10 06:57:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:54,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:54,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:54,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-01-10 06:57:54,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:54,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:54,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:54,933 INFO L124 PetriNetUnfolderBase]: 107/261 cut-off events. [2025-01-10 06:57:54,935 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:54,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 261 events. 107/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1137 event pairs, 82 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 454. Up to 184 conditions per place. [2025-01-10 06:57:54,937 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 16 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-01-10 06:57:54,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 92 flow [2025-01-10 06:57:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-01-10 06:57:54,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-01-10 06:57:54,940 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 60 flow. Second operand 3 states and 51 transitions. [2025-01-10 06:57:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 92 flow [2025-01-10 06:57:54,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 91 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:54,941 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 59 flow [2025-01-10 06:57:54,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-01-10 06:57:54,942 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2025-01-10 06:57:54,942 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 59 flow [2025-01-10 06:57:54,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-01-10 06:57:54,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:54,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:54,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1234768029, now seen corresponding path program 1 times [2025-01-10 06:57:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-01-10 06:57:54,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:54,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:54,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:54,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-01-10 06:57:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132718002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541127614] [2025-01-10 06:57:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:55,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:55,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-01-10 06:57:55,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,156 INFO L124 PetriNetUnfolderBase]: 213/440 cut-off events. [2025-01-10 06:57:55,156 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:55,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 440 events. 213/440 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1953 event pairs, 118 based on Foata normal form. 14/375 useless extension candidates. Maximal degree in co-relation 825. Up to 253 conditions per place. [2025-01-10 06:57:55,159 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-01-10 06:57:55,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 190 flow [2025-01-10 06:57:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 06:57:55,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2025-01-10 06:57:55,160 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 59 flow. Second operand 4 states and 87 transitions. [2025-01-10 06:57:55,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 190 flow [2025-01-10 06:57:55,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:55,162 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 80 flow [2025-01-10 06:57:55,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-01-10 06:57:55,163 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-01-10 06:57:55,163 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 80 flow [2025-01-10 06:57:55,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-01-10 06:57:55,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,163 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:55,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1420252474, now seen corresponding path program 1 times [2025-01-10 06:57:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896161333] [2025-01-10 06:57:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,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-01-10 06:57:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896161333] [2025-01-10 06:57:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896161333] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968548857] [2025-01-10 06:57:55,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:55,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:55,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:57:55,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:55,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:55,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:55,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:55,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:55,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793745823] [2025-01-10 06:57:55,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:55,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:55,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,464 INFO L124 PetriNetUnfolderBase]: 193/382 cut-off events. [2025-01-10 06:57:55,464 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 06:57:55,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 382 events. 193/382 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1610 event pairs, 23 based on Foata normal form. 14/357 useless extension candidates. Maximal degree in co-relation 843. Up to 94 conditions per place. [2025-01-10 06:57:55,467 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 53 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-01-10 06:57:55,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 65 transitions, 277 flow [2025-01-10 06:57:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-01-10 06:57:55,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2025-01-10 06:57:55,468 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 80 flow. Second operand 6 states and 125 transitions. [2025-01-10 06:57:55,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 65 transitions, 277 flow [2025-01-10 06:57:55,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:55,470 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 84 flow [2025-01-10 06:57:55,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2025-01-10 06:57:55,471 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-01-10 06:57:55,471 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 84 flow [2025-01-10 06:57:55,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:55,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:57:55,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:55,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1760323022, now seen corresponding path program 1 times [2025-01-10 06:57:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648615193] [2025-01-10 06:57:55,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:55,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:55,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648615193] [2025-01-10 06:57:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648615193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100280566] [2025-01-10 06:57:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:55,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:55,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:55,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:55,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-01-10 06:57:55,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:55,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,845 INFO L124 PetriNetUnfolderBase]: 303/598 cut-off events. [2025-01-10 06:57:55,846 INFO L125 PetriNetUnfolderBase]: For 424/434 co-relation queries the response was YES. [2025-01-10 06:57:55,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 598 events. 303/598 cut-off events. For 424/434 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2665 event pairs, 189 based on Foata normal form. 18/557 useless extension candidates. Maximal degree in co-relation 1405. Up to 387 conditions per place. [2025-01-10 06:57:55,849 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 39 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-01-10 06:57:55,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 256 flow [2025-01-10 06:57:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-01-10 06:57:55,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-01-10 06:57:55,850 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 84 flow. Second operand 4 states and 82 transitions. [2025-01-10 06:57:55,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 256 flow [2025-01-10 06:57:55,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 229 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:55,851 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 97 flow [2025-01-10 06:57:55,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2025-01-10 06:57:55,852 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2025-01-10 06:57:55,852 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 97 flow [2025-01-10 06:57:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-01-10 06:57:55,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,852 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:57:55,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:55,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1078153446, now seen corresponding path program 1 times [2025-01-10 06:57:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967868610] [2025-01-10 06:57:55,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:55,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:55,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967868610] [2025-01-10 06:57:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967868610] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12094459] [2025-01-10 06:57:55,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:55,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:55,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:55,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:57:55,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:55,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:55,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:55,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12094459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:55,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342137267] [2025-01-10 06:57:55,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:55,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:56,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:56,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 97 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-01-10 06:57:56,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:56,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,265 INFO L124 PetriNetUnfolderBase]: 568/1112 cut-off events. [2025-01-10 06:57:56,265 INFO L125 PetriNetUnfolderBase]: For 703/767 co-relation queries the response was YES. [2025-01-10 06:57:56,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 1112 events. 568/1112 cut-off events. For 703/767 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5538 event pairs, 151 based on Foata normal form. 60/1171 useless extension candidates. Maximal degree in co-relation 2760. Up to 315 conditions per place. [2025-01-10 06:57:56,271 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 115 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2025-01-10 06:57:56,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 131 transitions, 699 flow [2025-01-10 06:57:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2025-01-10 06:57:56,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684375 [2025-01-10 06:57:56,273 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 97 flow. Second operand 10 states and 219 transitions. [2025-01-10 06:57:56,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 131 transitions, 699 flow [2025-01-10 06:57:56,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 131 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:56,279 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 159 flow [2025-01-10 06:57:56,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=159, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2025-01-10 06:57:56,280 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2025-01-10 06:57:56,281 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 159 flow [2025-01-10 06:57:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-01-10 06:57:56,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:57:56,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:56,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 232762978, now seen corresponding path program 1 times [2025-01-10 06:57:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-01-10 06:57:56,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:56,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:56,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-01-10 06:57:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304235757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149463212] [2025-01-10 06:57:56,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:56,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:56,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:56,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:57:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:56,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:56,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:56,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149463212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:56,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298574078] [2025-01-10 06:57:56,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:56,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:56,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:56,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-01-10 06:57:56,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:56,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,768 INFO L124 PetriNetUnfolderBase]: 595/1160 cut-off events. [2025-01-10 06:57:56,768 INFO L125 PetriNetUnfolderBase]: For 1258/1272 co-relation queries the response was YES. [2025-01-10 06:57:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3191 conditions, 1160 events. 595/1160 cut-off events. For 1258/1272 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5751 event pairs, 156 based on Foata normal form. 39/1155 useless extension candidates. Maximal degree in co-relation 3178. Up to 317 conditions per place. [2025-01-10 06:57:56,773 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 84 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-01-10 06:57:56,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 695 flow [2025-01-10 06:57:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-01-10 06:57:56,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 06:57:56,774 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 159 flow. Second operand 6 states and 116 transitions. [2025-01-10 06:57:56,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 695 flow [2025-01-10 06:57:56,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 645 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:56,781 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 155 flow [2025-01-10 06:57:56,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-01-10 06:57:56,781 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-01-10 06:57:56,783 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 155 flow [2025-01-10 06:57:56,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-01-10 06:57:56,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,783 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:57:56,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:56,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:56,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1374281973, now seen corresponding path program 1 times [2025-01-10 06:57:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-01-10 06:57:56,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:56,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:56,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-01-10 06:57:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372854327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612283042] [2025-01-10 06:57:57,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:57,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:57,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:57,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:57:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:57,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:57,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:57,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612283042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:57,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355248157] [2025-01-10 06:57:57,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:57,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:57,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:57:57,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 155 flow. Second operand has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 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-01-10 06:57:57,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:57:57,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,480 INFO L124 PetriNetUnfolderBase]: 1099/2144 cut-off events. [2025-01-10 06:57:57,480 INFO L125 PetriNetUnfolderBase]: For 2568/2594 co-relation queries the response was YES. [2025-01-10 06:57:57,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6042 conditions, 2144 events. 1099/2144 cut-off events. For 2568/2594 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 11669 event pairs, 372 based on Foata normal form. 117/2256 useless extension candidates. Maximal degree in co-relation 6028. Up to 736 conditions per place. [2025-01-10 06:57:57,488 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 149 selfloop transitions, 9 changer transitions 0/164 dead transitions. [2025-01-10 06:57:57,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 164 transitions, 1155 flow [2025-01-10 06:57:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-01-10 06:57:57,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.621875 [2025-01-10 06:57:57,490 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 155 flow. Second operand 10 states and 199 transitions. [2025-01-10 06:57:57,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 164 transitions, 1155 flow [2025-01-10 06:57:57,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 164 transitions, 1140 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:57,495 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 210 flow [2025-01-10 06:57:57,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=210, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-01-10 06:57:57,495 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-01-10 06:57:57,495 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 210 flow [2025-01-10 06:57:57,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 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-01-10 06:57:57,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,495 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:57:57,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:57:57,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:57,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1560797853, now seen corresponding path program 2 times [2025-01-10 06:57:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-01-10 06:57:57,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 06:57:57,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-01-10 06:57:57,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340271110] [2025-01-10 06:57:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340271110] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760554235] [2025-01-10 06:57:57,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:57,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:57,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:57,754 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:57,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:57:57,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 06:57:57,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-01-10 06:57:57,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:57,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:57:57,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:57,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760554235] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:57,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724325034] [2025-01-10 06:57:57,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:57:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:57:57,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:57:57,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:57:57,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 210 flow. Second operand has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-01-10 06:57:57,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:57:57,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:58,481 INFO L124 PetriNetUnfolderBase]: 2694/5146 cut-off events. [2025-01-10 06:57:58,481 INFO L125 PetriNetUnfolderBase]: For 8684/8719 co-relation queries the response was YES. [2025-01-10 06:57:58,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15559 conditions, 5146 events. 2694/5146 cut-off events. For 8684/8719 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 34125 event pairs, 332 based on Foata normal form. 72/5218 useless extension candidates. Maximal degree in co-relation 15543. Up to 1195 conditions per place. [2025-01-10 06:57:58,498 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 30 changer transitions 6/160 dead transitions. [2025-01-10 06:57:58,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 160 transitions, 1219 flow [2025-01-10 06:57:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2025-01-10 06:57:58,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-01-10 06:57:58,500 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 210 flow. Second operand 10 states and 148 transitions. [2025-01-10 06:57:58,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 160 transitions, 1219 flow [2025-01-10 06:57:58,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 1149 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:58,522 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 470 flow [2025-01-10 06:57:58,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=470, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-01-10 06:57:58,523 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2025-01-10 06:57:58,524 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 470 flow [2025-01-10 06:57:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.615384615384615) internal successors, (112), 13 states have internal predecessors, (112), 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-01-10 06:57:58,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,525 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:57:58,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:58,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:58,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 779437599, now seen corresponding path program 2 times [2025-01-10 06:57:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-01-10 06:57:58,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 06:57:58,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-10 06:57:58,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:58,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-01-10 06:57:58,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549453840] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:58,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873290175] [2025-01-10 06:57:58,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:58,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:58,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:58,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:58,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:57:58,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-10 06:57:58,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 24 statements. [2025-01-10 06:57:58,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:58,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:57:58,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:58,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873290175] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:58,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-10 06:57:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730938619] [2025-01-10 06:57:58,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:57:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:57:58,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:59,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:57:59,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 470 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:59,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:57:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,561 INFO L124 PetriNetUnfolderBase]: 3414/6355 cut-off events. [2025-01-10 06:57:59,561 INFO L125 PetriNetUnfolderBase]: For 14909/14937 co-relation queries the response was YES. [2025-01-10 06:57:59,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21420 conditions, 6355 events. 3414/6355 cut-off events. For 14909/14937 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 42772 event pairs, 392 based on Foata normal form. 98/6453 useless extension candidates. Maximal degree in co-relation 21398. Up to 1641 conditions per place. [2025-01-10 06:57:59,588 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 77 selfloop transitions, 18 changer transitions 98/197 dead transitions. [2025-01-10 06:57:59,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 197 transitions, 1803 flow [2025-01-10 06:57:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2025-01-10 06:57:59,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.459375 [2025-01-10 06:57:59,590 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 470 flow. Second operand 10 states and 147 transitions. [2025-01-10 06:57:59,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 197 transitions, 1803 flow [2025-01-10 06:57:59,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 197 transitions, 1802 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:59,630 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 556 flow [2025-01-10 06:57:59,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=556, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-01-10 06:57:59,631 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2025-01-10 06:57:59,631 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 556 flow [2025-01-10 06:57:59,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:59,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,631 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:57:59,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:57:59,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:57:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -306505058, now seen corresponding path program 1 times [2025-01-10 06:57:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391645904] [2025-01-10 06:57:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:57:59,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:57:59,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:59,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391645904] [2025-01-10 06:57:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391645904] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147993713] [2025-01-10 06:57:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:59,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:57:59,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:57:59,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:00,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:00,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:00,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:00,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:58:00,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:00,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:00,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147993713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:00,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:00,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:58:00,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611483741] [2025-01-10 06:58:00,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:00,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:58:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:00,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:58:00,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:58:00,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:58:00,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 556 flow. Second operand has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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-01-10 06:58:00,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:00,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:58:00,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:00,984 INFO L124 PetriNetUnfolderBase]: 2804/5598 cut-off events. [2025-01-10 06:58:00,984 INFO L125 PetriNetUnfolderBase]: For 27140/27460 co-relation queries the response was YES. [2025-01-10 06:58:00,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22774 conditions, 5598 events. 2804/5598 cut-off events. For 27140/27460 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 36322 event pairs, 340 based on Foata normal form. 192/5789 useless extension candidates. Maximal degree in co-relation 22745. Up to 931 conditions per place. [2025-01-10 06:58:01,006 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 540 selfloop transitions, 42 changer transitions 80/672 dead transitions. [2025-01-10 06:58:01,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 672 transitions, 7118 flow [2025-01-10 06:58:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:58:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:58:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 486 transitions. [2025-01-10 06:58:01,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6903409090909091 [2025-01-10 06:58:01,009 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 556 flow. Second operand 22 states and 486 transitions. [2025-01-10 06:58:01,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 672 transitions, 7118 flow [2025-01-10 06:58:01,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 672 transitions, 6691 flow, removed 213 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:01,037 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 885 flow [2025-01-10 06:58:01,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=885, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2025-01-10 06:58:01,037 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2025-01-10 06:58:01,037 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 885 flow [2025-01-10 06:58:01,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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-01-10 06:58:01,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:01,038 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:01,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:01,242 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -894531864, now seen corresponding path program 1 times [2025-01-10 06:58:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133657729] [2025-01-10 06:58:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:01,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:01,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:01,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:01,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133657729] [2025-01-10 06:58:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133657729] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154367976] [2025-01-10 06:58:01,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:01,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:01,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:01,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:01,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:58:01,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:58:01,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:58:01,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:01,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:01,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:58:01,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:01,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154367976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:01,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:01,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:58:01,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896342600] [2025-01-10 06:58:01,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:58:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:01,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:58:01,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:58:01,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-01-10 06:58:01,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 885 flow. Second operand has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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-01-10 06:58:01,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:01,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-01-10 06:58:01,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:02,720 INFO L124 PetriNetUnfolderBase]: 5539/11060 cut-off events. [2025-01-10 06:58:02,721 INFO L125 PetriNetUnfolderBase]: For 64277/64335 co-relation queries the response was YES. [2025-01-10 06:58:02,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47594 conditions, 11060 events. 5539/11060 cut-off events. For 64277/64335 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 79304 event pairs, 926 based on Foata normal form. 474/11533 useless extension candidates. Maximal degree in co-relation 47562. Up to 1936 conditions per place. [2025-01-10 06:58:02,790 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 1054 selfloop transitions, 42 changer transitions 20/1126 dead transitions. [2025-01-10 06:58:02,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 1126 transitions, 14497 flow [2025-01-10 06:58:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:58:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:58:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 436 transitions. [2025-01-10 06:58:02,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2025-01-10 06:58:02,792 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 885 flow. Second operand 22 states and 436 transitions. [2025-01-10 06:58:02,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 1126 transitions, 14497 flow [2025-01-10 06:58:02,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 1126 transitions, 12061 flow, removed 840 selfloop flow, removed 9 redundant places. [2025-01-10 06:58:02,901 INFO L231 Difference]: Finished difference. Result has 122 places, 116 transitions, 1137 flow [2025-01-10 06:58:02,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1137, PETRI_PLACES=122, PETRI_TRANSITIONS=116} [2025-01-10 06:58:02,902 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 89 predicate places. [2025-01-10 06:58:02,902 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 116 transitions, 1137 flow [2025-01-10 06:58:02,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.333333333333334) internal successors, (296), 24 states have internal predecessors, (296), 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-01-10 06:58:02,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:02,902 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:02,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:03,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:03,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 112429022, now seen corresponding path program 2 times [2025-01-10 06:58:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-01-10 06:58:03,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:03,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:03,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:03,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:03,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038775366] [2025-01-10 06:58:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038775366] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832595843] [2025-01-10 06:58:03,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:03,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:58:03,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:03,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:03,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:03,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:58:03,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:03,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:03,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832595843] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:03,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:03,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-10 06:58:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012387840] [2025-01-10 06:58:03,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:03,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:58:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:03,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:58:03,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:58:03,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:58:03,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 116 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-01-10 06:58:03,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:03,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:58:03,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:04,592 INFO L124 PetriNetUnfolderBase]: 5436/11032 cut-off events. [2025-01-10 06:58:04,592 INFO L125 PetriNetUnfolderBase]: For 61144/61148 co-relation queries the response was YES. [2025-01-10 06:58:04,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47741 conditions, 11032 events. 5436/11032 cut-off events. For 61144/61148 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 79236 event pairs, 1701 based on Foata normal form. 72/11104 useless extension candidates. Maximal degree in co-relation 47703. Up to 4612 conditions per place. [2025-01-10 06:58:04,647 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 60 selfloop transitions, 3 changer transitions 130/197 dead transitions. [2025-01-10 06:58:04,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 197 transitions, 2371 flow [2025-01-10 06:58:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:58:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:58:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2025-01-10 06:58:04,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2025-01-10 06:58:04,648 INFO L175 Difference]: Start difference. First operand has 122 places, 116 transitions, 1137 flow. Second operand 8 states and 107 transitions. [2025-01-10 06:58:04,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 197 transitions, 2371 flow [2025-01-10 06:58:04,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 197 transitions, 2029 flow, removed 83 selfloop flow, removed 20 redundant places. [2025-01-10 06:58:04,857 INFO L231 Difference]: Finished difference. Result has 108 places, 64 transitions, 480 flow [2025-01-10 06:58:04,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=108, PETRI_TRANSITIONS=64} [2025-01-10 06:58:04,858 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2025-01-10 06:58:04,858 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 64 transitions, 480 flow [2025-01-10 06:58:04,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-01-10 06:58:04,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:04,858 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:05,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:05,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:58:05,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 787603496, now seen corresponding path program 2 times [2025-01-10 06:58:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031124384] [2025-01-10 06:58:05,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:05,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:05,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:05,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:05,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031124384] [2025-01-10 06:58:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031124384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282439129] [2025-01-10 06:58:05,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:05,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:05,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:58:05,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:58:05,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:58:05,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:05,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:58:05,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:05,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:58:05,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282439129] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:05,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:05,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:58:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917816429] [2025-01-10 06:58:05,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:05,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:58:05,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:05,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:58:05,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:58:05,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-01-10 06:58:05,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 64 transitions, 480 flow. Second operand has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:05,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:05,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-01-10 06:58:05,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:05,701 INFO L124 PetriNetUnfolderBase]: 2616/5347 cut-off events. [2025-01-10 06:58:05,701 INFO L125 PetriNetUnfolderBase]: For 18118/18118 co-relation queries the response was YES. [2025-01-10 06:58:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19664 conditions, 5347 events. 2616/5347 cut-off events. For 18118/18118 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 33248 event pairs, 2 based on Foata normal form. 79/5426 useless extension candidates. Maximal degree in co-relation 19636. Up to 2191 conditions per place. [2025-01-10 06:58:05,713 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 0 selfloop transitions, 0 changer transitions 122/122 dead transitions. [2025-01-10 06:58:05,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 122 transitions, 1093 flow [2025-01-10 06:58:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:58:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:58:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-01-10 06:58:05,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 06:58:05,714 INFO L175 Difference]: Start difference. First operand has 108 places, 64 transitions, 480 flow. Second operand 8 states and 96 transitions. [2025-01-10 06:58:05,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 122 transitions, 1093 flow [2025-01-10 06:58:05,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 122 transitions, 835 flow, removed 27 selfloop flow, removed 24 redundant places. [2025-01-10 06:58:05,740 INFO L231 Difference]: Finished difference. Result has 83 places, 0 transitions, 0 flow [2025-01-10 06:58:05,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=83, PETRI_TRANSITIONS=0} [2025-01-10 06:58:05,741 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2025-01-10 06:58:05,741 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 0 transitions, 0 flow [2025-01-10 06:58:05,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.461538461538462) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-01-10 06:58:05,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-01-10 06:58:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-01-10 06:58:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-01-10 06:58:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-01-10 06:58:05,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-01-10 06:58:05,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 06:58:05,944 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:05,947 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:58:05,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:58:05,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:58:05 BasicIcfg [2025-01-10 06:58:05,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:58:05,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:58:05,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:58:05,953 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:58:05,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:54" (3/4) ... [2025-01-10 06:58:05,954 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:58:05,956 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f1 [2025-01-10 06:58:05,956 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f2 [2025-01-10 06:58:05,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-01-10 06:58:05,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 06:58:05,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:58:05,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:58:06,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:58:06,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:58:06,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:58:06,006 INFO L158 Benchmark]: Toolchain (without parser) took 12385.55ms. Allocated memory was 167.8MB in the beginning and 788.5MB in the end (delta: 620.8MB). Free memory was 128.8MB in the beginning and 255.9MB in the end (delta: -127.1MB). Peak memory consumption was 490.0MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,007 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:58:06,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.74ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 109.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.19ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,007 INFO L158 Benchmark]: Boogie Preprocessor took 31.57ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:58:06,008 INFO L158 Benchmark]: RCFGBuilder took 363.77ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 82.8MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,008 INFO L158 Benchmark]: TraceAbstraction took 11575.32ms. Allocated memory was 167.8MB in the beginning and 788.5MB in the end (delta: 620.8MB). Free memory was 81.9MB in the beginning and 259.1MB in the end (delta: -177.2MB). Peak memory consumption was 594.9MB. Max. memory is 16.1GB. [2025-01-10 06:58:06,008 INFO L158 Benchmark]: Witness Printer took 51.78ms. Allocated memory is still 788.5MB. Free memory was 259.1MB in the beginning and 255.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:58:06,009 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.74ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 109.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.19ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.57ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 363.77ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 82.8MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11575.32ms. Allocated memory was 167.8MB in the beginning and 788.5MB in the end (delta: 620.8MB). Free memory was 81.9MB in the beginning and 259.1MB in the end (delta: -177.2MB). Peak memory consumption was 594.9MB. Max. memory is 16.1GB. * Witness Printer took 51.78ms. Allocated memory is still 788.5MB. Free memory was 259.1MB in the beginning and 255.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 761]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 761]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1686 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1631 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2920 IncrementalHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 33 mSDtfsCounter, 2920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 392 SyntacticMatches, 8 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1137occurred in iteration=12, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 499 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 42 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 1006/1376 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:58:06,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE