./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:36:37,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:36:37,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:36:37,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:36:37,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:36:37,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:36:37,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:36:37,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:36:37,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:36:37,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:36:37,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:36:37,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:36:37,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:36:37,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:36:37,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:36:37,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:36:37,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:36:37,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:36:37,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:36:37,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-03-17 19:36:37,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:36:37,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:36:37,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:36:37,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:36:37,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:36:37,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-17 19:36:38,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1d16ad2/d8266f7ce2784bbeaedc258e9f0b1eea/FLAG47b317f27 [2025-03-17 19:36:39,235 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:36:39,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-17 19:36:39,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1d16ad2/d8266f7ce2784bbeaedc258e9f0b1eea/FLAG47b317f27 [2025-03-17 19:36:39,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb1d16ad2/d8266f7ce2784bbeaedc258e9f0b1eea [2025-03-17 19:36:39,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:36:39,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:36:39,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:36:39,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:36:39,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:36:39,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:36:39" (1/1) ... [2025-03-17 19:36:39,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155541c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:39, skipping insertion in model container [2025-03-17 19:36:39,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:36:39" (1/1) ... [2025-03-17 19:36:39,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:36:39,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:36:40,006 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:36:40,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:36:40,125 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:36:40,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40 WrapperNode [2025-03-17 19:36:40,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:36:40,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:36:40,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:36:40,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:36:40,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,174 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 179 [2025-03-17 19:36:40,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:36:40,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:36:40,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:36:40,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:36:40,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,208 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-03-17 19:36:40,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:36:40,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:36:40,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:36:40,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:36:40,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (1/1) ... [2025-03-17 19:36:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:36:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:40,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:36:40,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:36:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:36:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:36:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:36:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 19:36:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 19:36:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 19:36:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:36:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:36:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:36:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:36:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:36:40,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 19:36:40,307 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 19:36:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:36:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:36:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:36:40,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:36:40,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:36:40,311 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:36:40,453 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:36:40,455 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:36:40,808 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:36:40,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:36:41,223 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:36:41,223 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:36:41,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:36:41 BoogieIcfgContainer [2025-03-17 19:36:41,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:36:41,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:36:41,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:36:41,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:36:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:36:39" (1/3) ... [2025-03-17 19:36:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd98632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:36:41, skipping insertion in model container [2025-03-17 19:36:41,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:40" (2/3) ... [2025-03-17 19:36:41,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd98632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:36:41, skipping insertion in model container [2025-03-17 19:36:41,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:36:41" (3/3) ... [2025-03-17 19:36:41,232 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-17 19:36:41,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:36:41,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-17 19:36:41,248 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:36:41,295 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 19:36:41,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 74 flow [2025-03-17 19:36:41,353 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2025-03-17 19:36:41,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:36:41,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-17 19:36:41,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 35 transitions, 74 flow [2025-03-17 19:36:41,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 34 transitions, 71 flow [2025-03-17 19:36:41,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:36:41,390 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;@58db23b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:36:41,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 19:36:41,396 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:36:41,396 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-17 19:36:41,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:36:41,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:41,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 19:36:41,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:41,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:41,406 INFO L85 PathProgramCache]: Analyzing trace with hash 444115, now seen corresponding path program 1 times [2025-03-17 19:36:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:41,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660488772] [2025-03-17 19:36:41,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:41,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:36:41,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:36:41,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:41,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660488772] [2025-03-17 19:36:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660488772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:41,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:41,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:36:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951717770] [2025-03-17 19:36:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:41,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:41,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:41,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:41,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:41,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:41,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:41,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:42,126 INFO L124 PetriNetUnfolderBase]: 86/246 cut-off events. [2025-03-17 19:36:42,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:36:42,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 246 events. 86/246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 997 event pairs, 36 based on Foata normal form. 8/233 useless extension candidates. Maximal degree in co-relation 403. Up to 106 conditions per place. [2025-03-17 19:36:42,129 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 30 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-03-17 19:36:42,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 169 flow [2025-03-17 19:36:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-17 19:36:42,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-17 19:36:42,145 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 71 flow. Second operand 4 states and 95 transitions. [2025-03-17 19:36:42,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 169 flow [2025-03-17 19:36:42,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:36:42,153 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 106 flow [2025-03-17 19:36:42,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-17 19:36:42,159 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-03-17 19:36:42,159 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 106 flow [2025-03-17 19:36:42,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:42,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:42,160 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 19:36:42,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:36:42,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 346091468, now seen corresponding path program 1 times [2025-03-17 19:36:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984076958] [2025-03-17 19:36:42,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:42,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:36:42,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:36:42,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:42,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:42,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:42,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984076958] [2025-03-17 19:36:42,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984076958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:42,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107504829] [2025-03-17 19:36:42,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:42,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:42,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:42,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:36:42,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:36:42,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:36:42,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:42,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:36:42,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:42,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:36:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107504829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:36:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:36:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298738087] [2025-03-17 19:36:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:42,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:36:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:42,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:36:42,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:36:42,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:42,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:42,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:42,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:42,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:42,788 INFO L124 PetriNetUnfolderBase]: 86/242 cut-off events. [2025-03-17 19:36:42,792 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 19:36:42,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 242 events. 86/242 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 961 event pairs, 0 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 446. Up to 92 conditions per place. [2025-03-17 19:36:42,795 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 34 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-17 19:36:42,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 220 flow [2025-03-17 19:36:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:36:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:36:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-17 19:36:42,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 19:36:42,801 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 106 flow. Second operand 6 states and 126 transitions. [2025-03-17 19:36:42,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 220 flow [2025-03-17 19:36:42,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:36:42,804 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 112 flow [2025-03-17 19:36:42,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-03-17 19:36:42,805 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-17 19:36:42,805 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 112 flow [2025-03-17 19:36:42,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:42,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:42,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 19:36:42,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:36:43,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:43,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2138901279, now seen corresponding path program 1 times [2025-03-17 19:36:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625786586] [2025-03-17 19:36:43,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:43,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:36:43,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:36:43,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:43,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:36:43,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625786586] [2025-03-17 19:36:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625786586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:43,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:43,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:36:43,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417790796] [2025-03-17 19:36:43,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:43,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:36:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:43,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:36:43,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:36:43,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:43,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:43,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:43,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:43,251 INFO L124 PetriNetUnfolderBase]: 86/254 cut-off events. [2025-03-17 19:36:43,252 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-17 19:36:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 254 events. 86/254 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1070 event pairs, 66 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 467. Up to 174 conditions per place. [2025-03-17 19:36:43,254 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 18 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2025-03-17 19:36:43,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 152 flow [2025-03-17 19:36:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:36:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:36:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-17 19:36:43,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-17 19:36:43,255 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 112 flow. Second operand 3 states and 62 transitions. [2025-03-17 19:36:43,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 152 flow [2025-03-17 19:36:43,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 140 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 19:36:43,256 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 104 flow [2025-03-17 19:36:43,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-03-17 19:36:43,257 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-03-17 19:36:43,257 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 104 flow [2025-03-17 19:36:43,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:43,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:43,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:36:43,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:43,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2053950043, now seen corresponding path program 1 times [2025-03-17 19:36:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904053043] [2025-03-17 19:36:43,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:43,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:36:43,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:36:43,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:43,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904053043] [2025-03-17 19:36:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904053043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735437239] [2025-03-17 19:36:43,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:43,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:43,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:43,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:36:43,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:36:43,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:36:43,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:43,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:43,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:36:43,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:36:43,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:36:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735437239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:36:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-17 19:36:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2847971] [2025-03-17 19:36:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:36:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:43,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:36:43,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:36:43,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:43,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-03-17 19:36:43,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:43,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:43,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:43,700 INFO L124 PetriNetUnfolderBase]: 194/520 cut-off events. [2025-03-17 19:36:43,700 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-17 19:36:43,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 520 events. 194/520 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2560 event pairs, 66 based on Foata normal form. 12/471 useless extension candidates. Maximal degree in co-relation 934. Up to 192 conditions per place. [2025-03-17 19:36:43,705 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-17 19:36:43,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 221 flow [2025-03-17 19:36:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:36:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:36:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-17 19:36:43,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2025-03-17 19:36:43,707 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 104 flow. Second operand 3 states and 78 transitions. [2025-03-17 19:36:43,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 221 flow [2025-03-17 19:36:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:43,709 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 126 flow [2025-03-17 19:36:43,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-17 19:36:43,710 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-03-17 19:36:43,710 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 126 flow [2025-03-17 19:36:43,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-03-17 19:36:43,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:43,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:43,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 19:36:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 19:36:43,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 752058511, now seen corresponding path program 1 times [2025-03-17 19:36:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457830055] [2025-03-17 19:36:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:43,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:36:43,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:36:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457830055] [2025-03-17 19:36:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457830055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489051577] [2025-03-17 19:36:44,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:44,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:44,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:36:44,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:36:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:36:44,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:44,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:44,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 19:36:44,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 19:36:44,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:36:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489051577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:44,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:36:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-17 19:36:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917420655] [2025-03-17 19:36:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:44,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:36:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:44,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:36:44,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:36:44,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:44,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-03-17 19:36:44,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:44,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:44,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:44,333 INFO L124 PetriNetUnfolderBase]: 170/496 cut-off events. [2025-03-17 19:36:44,333 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2025-03-17 19:36:44,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 496 events. 170/496 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2572 event pairs, 77 based on Foata normal form. 24/482 useless extension candidates. Maximal degree in co-relation 999. Up to 200 conditions per place. [2025-03-17 19:36:44,338 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 34 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-17 19:36:44,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 225 flow [2025-03-17 19:36:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:36:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:36:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-17 19:36:44,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-03-17 19:36:44,340 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 126 flow. Second operand 3 states and 77 transitions. [2025-03-17 19:36:44,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 225 flow [2025-03-17 19:36:44,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:44,342 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 116 flow [2025-03-17 19:36:44,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-17 19:36:44,343 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-03-17 19:36:44,343 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 116 flow [2025-03-17 19:36:44,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-03-17 19:36:44,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:44,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:44,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 19:36:44,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:44,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1529846584, now seen corresponding path program 1 times [2025-03-17 19:36:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:44,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451882708] [2025-03-17 19:36:44,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:44,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:44,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:36:44,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:36:44,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:44,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451882708] [2025-03-17 19:36:44,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451882708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580339908] [2025-03-17 19:36:44,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:44,660 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:44,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:36:44,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:36:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:36:44,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:44,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:44,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:36:44,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:44,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:36:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:36:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580339908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:36:44,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:36:44,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 19:36:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719039631] [2025-03-17 19:36:44,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:36:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:36:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:36:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:36:44,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:36:44,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 116 flow. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 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-03-17 19:36:44,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:44,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:36:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:45,192 INFO L124 PetriNetUnfolderBase]: 170/446 cut-off events. [2025-03-17 19:36:45,192 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-17 19:36:45,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 446 events. 170/446 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2130 event pairs, 22 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 907. Up to 145 conditions per place. [2025-03-17 19:36:45,196 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 37 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2025-03-17 19:36:45,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 294 flow [2025-03-17 19:36:45,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:36:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:36:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2025-03-17 19:36:45,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-03-17 19:36:45,197 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 116 flow. Second operand 7 states and 138 transitions. [2025-03-17 19:36:45,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 294 flow [2025-03-17 19:36:45,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:36:45,199 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 178 flow [2025-03-17 19:36:45,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-17 19:36:45,202 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-17 19:36:45,203 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 178 flow [2025-03-17 19:36:45,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 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-03-17 19:36:45,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:45,204 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:45,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:36:45,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:45,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:45,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1819700072, now seen corresponding path program 2 times [2025-03-17 19:36:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099615430] [2025-03-17 19:36:45,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:45,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 19:36:45,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 19 statements. [2025-03-17 19:36:45,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:36:45,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:36:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:45,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099615430] [2025-03-17 19:36:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099615430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886393952] [2025-03-17 19:36:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:45,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:45,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:45,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:45,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:45,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:45,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:45,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:45,617 INFO L124 PetriNetUnfolderBase]: 170/483 cut-off events. [2025-03-17 19:36:45,618 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-17 19:36:45,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 483 events. 170/483 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2376 event pairs, 88 based on Foata normal form. 24/486 useless extension candidates. Maximal degree in co-relation 1041. Up to 220 conditions per place. [2025-03-17 19:36:45,622 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 35 selfloop transitions, 7 changer transitions 1/55 dead transitions. [2025-03-17 19:36:45,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 318 flow [2025-03-17 19:36:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-17 19:36:45,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-03-17 19:36:45,623 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 178 flow. Second operand 4 states and 93 transitions. [2025-03-17 19:36:45,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 318 flow [2025-03-17 19:36:45,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 306 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:45,626 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 178 flow [2025-03-17 19:36:45,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-03-17 19:36:45,626 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-03-17 19:36:45,629 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 178 flow [2025-03-17 19:36:45,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:45,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:45,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:36:45,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash -576127011, now seen corresponding path program 1 times [2025-03-17 19:36:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558892795] [2025-03-17 19:36:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:45,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 19:36:45,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 19:36:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:36:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:45,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558892795] [2025-03-17 19:36:45,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558892795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:45,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001828420] [2025-03-17 19:36:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:45,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:45,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:45,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:45,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-17 19:36:45,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:45,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:45,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-17 19:36:45,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:46,056 INFO L124 PetriNetUnfolderBase]: 158/431 cut-off events. [2025-03-17 19:36:46,057 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-03-17 19:36:46,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 431 events. 158/431 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1956 event pairs, 85 based on Foata normal form. 12/428 useless extension candidates. Maximal degree in co-relation 981. Up to 201 conditions per place. [2025-03-17 19:36:46,061 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 42 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-03-17 19:36:46,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 338 flow [2025-03-17 19:36:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-17 19:36:46,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-17 19:36:46,063 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 178 flow. Second operand 4 states and 98 transitions. [2025-03-17 19:36:46,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 338 flow [2025-03-17 19:36:46,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:46,069 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 190 flow [2025-03-17 19:36:46,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-03-17 19:36:46,070 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-03-17 19:36:46,071 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 190 flow [2025-03-17 19:36:46,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:46,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:46,072 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:46,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:36:46,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:46,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 42317319, now seen corresponding path program 1 times [2025-03-17 19:36:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:46,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673403114] [2025-03-17 19:36:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:46,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 19:36:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 19:36:46,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:46,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:36:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673403114] [2025-03-17 19:36:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673403114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935226321] [2025-03-17 19:36:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:46,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:46,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:46,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:46,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-17 19:36:46,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:46,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:46,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-17 19:36:46,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:46,436 INFO L124 PetriNetUnfolderBase]: 194/493 cut-off events. [2025-03-17 19:36:46,436 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-17 19:36:46,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 493 events. 194/493 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2302 event pairs, 110 based on Foata normal form. 24/512 useless extension candidates. Maximal degree in co-relation 1220. Up to 275 conditions per place. [2025-03-17 19:36:46,443 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 50 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-03-17 19:36:46,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 396 flow [2025-03-17 19:36:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-17 19:36:46,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-03-17 19:36:46,444 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 190 flow. Second operand 4 states and 92 transitions. [2025-03-17 19:36:46,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 396 flow [2025-03-17 19:36:46,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:36:46,449 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 204 flow [2025-03-17 19:36:46,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2025-03-17 19:36:46,450 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-03-17 19:36:46,450 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 204 flow [2025-03-17 19:36:46,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:46,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:46,451 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:46,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:36:46,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:46,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2113355160, now seen corresponding path program 1 times [2025-03-17 19:36:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973078828] [2025-03-17 19:36:46,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:46,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:36:46,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:36:46,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:46,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 19:36:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973078828] [2025-03-17 19:36:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973078828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085159681] [2025-03-17 19:36:46,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:46,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:46,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:46,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:36:46,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 19:36:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 19:36:46,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:46,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:46,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:36:46,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:36:46,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:36:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:36:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085159681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:36:46,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:36:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 19 [2025-03-17 19:36:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129228283] [2025-03-17 19:36:46,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:36:46,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 19:36:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:46,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 19:36:46,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-17 19:36:46,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-17 19:36:46,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 204 flow. Second operand has 19 states, 19 states have (on average 10.947368421052632) internal successors, (208), 19 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:46,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:46,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-17 19:36:46,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:47,722 INFO L124 PetriNetUnfolderBase]: 352/833 cut-off events. [2025-03-17 19:36:47,722 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2025-03-17 19:36:47,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 833 events. 352/833 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3907 event pairs, 16 based on Foata normal form. 18/847 useless extension candidates. Maximal degree in co-relation 2197. Up to 120 conditions per place. [2025-03-17 19:36:47,729 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 100 selfloop transitions, 49 changer transitions 0/156 dead transitions. [2025-03-17 19:36:47,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 156 transitions, 988 flow [2025-03-17 19:36:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:36:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 19:36:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 372 transitions. [2025-03-17 19:36:47,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-03-17 19:36:47,734 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 204 flow. Second operand 24 states and 372 transitions. [2025-03-17 19:36:47,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 156 transitions, 988 flow [2025-03-17 19:36:47,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 156 transitions, 955 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:36:47,751 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 606 flow [2025-03-17 19:36:47,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=606, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-03-17 19:36:47,753 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-03-17 19:36:47,754 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 606 flow [2025-03-17 19:36:47,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.947368421052632) internal successors, (208), 19 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:47,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:47,755 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:47,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:36:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 19:36:47,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -726282813, now seen corresponding path program 1 times [2025-03-17 19:36:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417048207] [2025-03-17 19:36:47,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:47,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:36:48,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:36:48,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:48,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 19:36:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417048207] [2025-03-17 19:36:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417048207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182051083] [2025-03-17 19:36:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:48,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:48,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:48,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:36:48,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 606 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:48,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:48,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:36:48,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:48,303 INFO L124 PetriNetUnfolderBase]: 262/722 cut-off events. [2025-03-17 19:36:48,304 INFO L125 PetriNetUnfolderBase]: For 1757/1759 co-relation queries the response was YES. [2025-03-17 19:36:48,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 722 events. 262/722 cut-off events. For 1757/1759 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3353 event pairs, 117 based on Foata normal form. 17/731 useless extension candidates. Maximal degree in co-relation 2040. Up to 324 conditions per place. [2025-03-17 19:36:48,308 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 43 selfloop transitions, 33 changer transitions 8/97 dead transitions. [2025-03-17 19:36:48,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 97 transitions, 910 flow [2025-03-17 19:36:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-17 19:36:48,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-17 19:36:48,310 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 606 flow. Second operand 4 states and 89 transitions. [2025-03-17 19:36:48,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 97 transitions, 910 flow [2025-03-17 19:36:48,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 97 transitions, 859 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-17 19:36:48,316 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 595 flow [2025-03-17 19:36:48,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=595, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2025-03-17 19:36:48,317 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2025-03-17 19:36:48,317 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 595 flow [2025-03-17 19:36:48,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:48,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:48,317 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:36:48,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1742073412, now seen corresponding path program 1 times [2025-03-17 19:36:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608583779] [2025-03-17 19:36:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:48,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 19:36:48,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 19:36:48,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:48,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-17 19:36:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608583779] [2025-03-17 19:36:48,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608583779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:48,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:48,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:36:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088677606] [2025-03-17 19:36:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:36:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:48,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:36:48,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:36:48,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:36:48,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:48,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:48,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:36:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:48,692 INFO L124 PetriNetUnfolderBase]: 246/667 cut-off events. [2025-03-17 19:36:48,692 INFO L125 PetriNetUnfolderBase]: For 2054/2056 co-relation queries the response was YES. [2025-03-17 19:36:48,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 667 events. 246/667 cut-off events. For 2054/2056 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3048 event pairs, 98 based on Foata normal form. 26/688 useless extension candidates. Maximal degree in co-relation 1908. Up to 410 conditions per place. [2025-03-17 19:36:48,699 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 57 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2025-03-17 19:36:48,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 803 flow [2025-03-17 19:36:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:36:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:36:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-17 19:36:48,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-03-17 19:36:48,701 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 595 flow. Second operand 3 states and 68 transitions. [2025-03-17 19:36:48,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 803 flow [2025-03-17 19:36:48,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 80 transitions, 695 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-17 19:36:48,708 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 515 flow [2025-03-17 19:36:48,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2025-03-17 19:36:48,709 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2025-03-17 19:36:48,709 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 515 flow [2025-03-17 19:36:48,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:48,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:48,710 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:48,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:36:48,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2018715558, now seen corresponding path program 1 times [2025-03-17 19:36:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:48,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865853596] [2025-03-17 19:36:48,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 19:36:48,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 19:36:48,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:36:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865853596] [2025-03-17 19:36:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865853596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528438899] [2025-03-17 19:36:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:49,201 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:49,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:36:49,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 19:36:49,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 19:36:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:49,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:36:49,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:36:49,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:36:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 19:36:49,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528438899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:36:49,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:36:49,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-17 19:36:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236834962] [2025-03-17 19:36:49,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:36:49,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 19:36:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:49,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:36:49,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 19:36:49,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-17 19:36:49,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 515 flow. Second operand has 23 states, 23 states have (on average 14.391304347826088) internal successors, (331), 23 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:49,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:49,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-17 19:36:49,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:50,120 INFO L124 PetriNetUnfolderBase]: 226/601 cut-off events. [2025-03-17 19:36:50,120 INFO L125 PetriNetUnfolderBase]: For 1533/1533 co-relation queries the response was YES. [2025-03-17 19:36:50,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 601 events. 226/601 cut-off events. For 1533/1533 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2668 event pairs, 71 based on Foata normal form. 3/599 useless extension candidates. Maximal degree in co-relation 1678. Up to 193 conditions per place. [2025-03-17 19:36:50,124 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 40 selfloop transitions, 37 changer transitions 0/87 dead transitions. [2025-03-17 19:36:50,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 793 flow [2025-03-17 19:36:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:36:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 19:36:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 332 transitions. [2025-03-17 19:36:50,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45170068027210886 [2025-03-17 19:36:50,126 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 515 flow. Second operand 21 states and 332 transitions. [2025-03-17 19:36:50,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 793 flow [2025-03-17 19:36:50,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:36:50,133 INFO L231 Difference]: Finished difference. Result has 99 places, 74 transitions, 673 flow [2025-03-17 19:36:50,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=673, PETRI_PLACES=99, PETRI_TRANSITIONS=74} [2025-03-17 19:36:50,134 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2025-03-17 19:36:50,135 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 74 transitions, 673 flow [2025-03-17 19:36:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.391304347826088) internal successors, (331), 23 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:50,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:50,135 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:50,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:36:50,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:50,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:50,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash -558796127, now seen corresponding path program 2 times [2025-03-17 19:36:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220996393] [2025-03-17 19:36:50,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:50,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 19:36:50,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:36:50,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:36:50,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:36:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220996393] [2025-03-17 19:36:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220996393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:36:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948094286] [2025-03-17 19:36:50,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:50,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:50,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:36:50,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:36:50,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 19:36:50,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 19:36:50,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:36:50,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:50,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:36:50,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:36:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:36:51,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:36:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948094286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:36:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-17 19:36:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352628866] [2025-03-17 19:36:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:51,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:36:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:51,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:36:51,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:36:51,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-17 19:36:51,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 74 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:51,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:51,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-17 19:36:51,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:51,204 INFO L124 PetriNetUnfolderBase]: 258/626 cut-off events. [2025-03-17 19:36:51,204 INFO L125 PetriNetUnfolderBase]: For 1828/1831 co-relation queries the response was YES. [2025-03-17 19:36:51,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 626 events. 258/626 cut-off events. For 1828/1831 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2578 event pairs, 83 based on Foata normal form. 38/662 useless extension candidates. Maximal degree in co-relation 1824. Up to 303 conditions per place. [2025-03-17 19:36:51,210 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 68 selfloop transitions, 14 changer transitions 0/93 dead transitions. [2025-03-17 19:36:51,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 969 flow [2025-03-17 19:36:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-17 19:36:51,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-17 19:36:51,212 INFO L175 Difference]: Start difference. First operand has 99 places, 74 transitions, 673 flow. Second operand 4 states and 80 transitions. [2025-03-17 19:36:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 969 flow [2025-03-17 19:36:51,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 875 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-03-17 19:36:51,220 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 607 flow [2025-03-17 19:36:51,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=607, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2025-03-17 19:36:51,221 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-03-17 19:36:51,221 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 607 flow [2025-03-17 19:36:51,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:51,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:51,222 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:51,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 19:36:51,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:36:51,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-17 19:36:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -142810343, now seen corresponding path program 1 times [2025-03-17 19:36:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895188942] [2025-03-17 19:36:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:51,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 19:36:51,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 19:36:51,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:51,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 19:36:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895188942] [2025-03-17 19:36:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895188942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:51,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:51,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880210612] [2025-03-17 19:36:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:51,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:51,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:51,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-03-17 19:36:51,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 607 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:51,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:51,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-03-17 19:36:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:51,738 INFO L124 PetriNetUnfolderBase]: 234/614 cut-off events. [2025-03-17 19:36:51,738 INFO L125 PetriNetUnfolderBase]: For 1696/1699 co-relation queries the response was YES. [2025-03-17 19:36:51,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 614 events. 234/614 cut-off events. For 1696/1699 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2556 event pairs, 23 based on Foata normal form. 27/639 useless extension candidates. Maximal degree in co-relation 1733. Up to 313 conditions per place. [2025-03-17 19:36:51,741 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 0 selfloop transitions, 0 changer transitions 95/95 dead transitions. [2025-03-17 19:36:51,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 95 transitions, 939 flow [2025-03-17 19:36:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:36:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 19:36:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-03-17 19:36:51,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2025-03-17 19:36:51,742 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 607 flow. Second operand 4 states and 79 transitions. [2025-03-17 19:36:51,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 95 transitions, 939 flow [2025-03-17 19:36:51,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 905 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 19:36:51,746 INFO L231 Difference]: Finished difference. Result has 84 places, 0 transitions, 0 flow [2025-03-17 19:36:51,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=84, PETRI_TRANSITIONS=0} [2025-03-17 19:36:51,746 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2025-03-17 19:36:51,746 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 0 transitions, 0 flow [2025-03-17 19:36:51,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:36:51,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-17 19:36:51,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-17 19:36:51,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-17 19:36:51,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-17 19:36:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:36:51,750 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:51,754 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 19:36:51,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 19:36:51,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:36:51 BasicIcfg [2025-03-17 19:36:51,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 19:36:51,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:36:51,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:36:51,758 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:36:51,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:36:41" (3/4) ... [2025-03-17 19:36:51,759 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 19:36:51,762 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-17 19:36:51,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-03-17 19:36:51,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-03-17 19:36:51,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 19:36:51,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 19:36:51,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 19:36:51,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 19:36:51,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:36:51,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 19:36:51,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:36:51,836 INFO L158 Benchmark]: Toolchain (without parser) took 12314.22ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 110.9MB in the beginning and 363.8MB in the end (delta: -252.8MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. [2025-03-17 19:36:51,836 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:36:51,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.34ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 71.1MB in the end (delta: 39.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 19:36:51,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 68.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:36:51,837 INFO L158 Benchmark]: Boogie Preprocessor took 55.03ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 65.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:36:51,837 INFO L158 Benchmark]: IcfgBuilder took 993.13ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.0MB in the beginning and 376.5MB in the end (delta: -311.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2025-03-17 19:36:51,838 INFO L158 Benchmark]: TraceAbstraction took 10531.82ms. Allocated memory was 427.8MB in the beginning and 520.1MB in the end (delta: 92.3MB). Free memory was 376.5MB in the beginning and 368.0MB in the end (delta: 8.5MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2025-03-17 19:36:51,838 INFO L158 Benchmark]: Witness Printer took 77.14ms. Allocated memory is still 520.1MB. Free memory was 368.0MB in the beginning and 363.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:36:51,839 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.30ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.34ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 71.1MB in the end (delta: 39.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 68.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.03ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 65.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 993.13ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.0MB in the beginning and 376.5MB in the end (delta: -311.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10531.82ms. Allocated memory was 427.8MB in the beginning and 520.1MB in the end (delta: 92.3MB). Free memory was 376.5MB in the beginning and 368.0MB in the end (delta: 8.5MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. * Witness Printer took 77.14ms. Allocated memory is still 520.1MB. Free memory was 368.0MB in the beginning and 363.8MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1253]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1253]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1258]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1244]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1244]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: 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 3 procedures, 49 locations, 51 edges, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 620 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 408 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1968 IncrementalHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 37 mSDtfsCounter, 1968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 205 SyntacticMatches, 11 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=13, InterpolantAutomatonStates: 98, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 522 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 1010 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3191 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 691/944 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 19:36:51,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE