./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:02:37,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:02:37,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:02:37,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:02:37,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:02:37,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:02:37,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:02:37,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:02:37,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:02:37,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:02:37,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:02:37,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:02:37,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:02:37,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:02:37,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:02:37,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:02:37,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:02:37,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:02:37,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:02:37,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:02:37,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:02:37,791 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-02-08 14:02:37,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:02:38,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:02:38,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:02:38,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:02:38,007 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:02:38,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-08 14:02:39,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfc03b22b/9c188551b4164f03b4b0077f3ce2e23e/FLAG652f96be5 [2025-02-08 14:02:39,633 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:02:39,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-08 14:02:39,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfc03b22b/9c188551b4164f03b4b0077f3ce2e23e/FLAG652f96be5 [2025-02-08 14:02:39,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfc03b22b/9c188551b4164f03b4b0077f3ce2e23e [2025-02-08 14:02:39,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:02:39,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:02:39,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:02:39,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:02:39,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:02:39,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:02:39" (1/1) ... [2025-02-08 14:02:39,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32cc897d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:39, skipping insertion in model container [2025-02-08 14:02:39,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:02:39" (1/1) ... [2025-02-08 14:02:39,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:02:40,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:02:40,450 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:02:40,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:02:40,555 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:02:40,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40 WrapperNode [2025-02-08 14:02:40,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:02:40,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:02:40,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:02:40,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:02:40,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,595 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-02-08 14:02:40,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:02:40,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:02:40,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:02:40,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:02:40,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,614 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-02-08 14:02:40,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:02:40,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:02:40,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:02:40,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:02:40,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (1/1) ... [2025-02-08 14:02:40,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:02:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:40,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:02:40,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:02:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:02:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:02:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:02:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:02:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 14:02:40,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:02:40,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:02:40,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:02:40,688 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:02:40,980 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:02:40,985 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:02:41,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742: havoc #t~ret21#1; [2025-02-08 14:02:41,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-1: ~elem~0#1 := #t~ret21#1; [2025-02-08 14:02:41,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-2: assume { :end_inline_Pop } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647; [2025-02-08 14:02:41,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-3: havoc Pop_#t~mem8#1, Pop_#t~mem9#1, Pop_#t~mem10#1, Pop_#t~ret11#1, Pop_#t~mem12#1, Pop_#t~ret13#1, Pop_#t~mem14#1, Pop_#t~mem15#1, Pop_~head2~0#1, Pop_~head1~0#1, Pop_~next1~0#1; [2025-02-08 14:02:41,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-4: #t~ret21#1 := Pop_#res#1; [2025-02-08 14:02:41,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1743: assume ~elem~0#1 >= 0; [2025-02-08 14:02:41,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1743: assume !(~elem~0#1 >= 0); [2025-02-08 14:02:41,259 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:02:41,259 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:02:41,370 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:02:41,370 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:02:41,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:02:41 BoogieIcfgContainer [2025-02-08 14:02:41,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:02:41,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:02:41,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:02:41,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:02:41,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:02:39" (1/3) ... [2025-02-08 14:02:41,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788ca789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:02:41, skipping insertion in model container [2025-02-08 14:02:41,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:40" (2/3) ... [2025-02-08 14:02:41,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788ca789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:02:41, skipping insertion in model container [2025-02-08 14:02:41,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:02:41" (3/3) ... [2025-02-08 14:02:41,377 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-02-08 14:02:41,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:02:41,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 70 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-02-08 14:02:41,391 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:02:41,434 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:02:41,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 80 transitions, 167 flow [2025-02-08 14:02:41,494 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-02-08 14:02:41,498 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:02:41,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 84 events. 10/84 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 206 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 44. Up to 3 conditions per place. [2025-02-08 14:02:41,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 80 transitions, 167 flow [2025-02-08 14:02:41,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 79 transitions, 165 flow [2025-02-08 14:02:41,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:02:41,536 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;@4c3db65b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:02:41,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:02:41,540 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:02:41,540 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-08 14:02:41,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:02:41,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:41,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:02:41,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 444583804, now seen corresponding path program 1 times [2025-02-08 14:02:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:41,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80758627] [2025-02-08 14:02:41,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:41,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:02:41,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:02:41,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:41,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80758627] [2025-02-08 14:02:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80758627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:41,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:41,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:02:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349384200] [2025-02-08 14:02:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:41,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:41,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:41,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:41,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-02-08 14:02:41,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:41,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:41,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-02-08 14:02:41,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:42,020 INFO L124 PetriNetUnfolderBase]: 124/310 cut-off events. [2025-02-08 14:02:42,021 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:02:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 310 events. 124/310 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1114 event pairs, 102 based on Foata normal form. 12/254 useless extension candidates. Maximal degree in co-relation 516. Up to 249 conditions per place. [2025-02-08 14:02:42,023 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 31 selfloop transitions, 2 changer transitions 1/62 dead transitions. [2025-02-08 14:02:42,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 199 flow [2025-02-08 14:02:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-02-08 14:02:42,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-08 14:02:42,034 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 165 flow. Second operand 3 states and 128 transitions. [2025-02-08 14:02:42,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 199 flow [2025-02-08 14:02:42,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:02:42,039 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 133 flow [2025-02-08 14:02:42,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-02-08 14:02:42,042 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-02-08 14:02:42,042 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 133 flow [2025-02-08 14:02:42,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:42,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:42,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:02:42,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:42,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1082647709, now seen corresponding path program 1 times [2025-02-08 14:02:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179200861] [2025-02-08 14:02:42,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:42,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:02:42,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:02:42,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179200861] [2025-02-08 14:02:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179200861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:42,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:42,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:02:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181805678] [2025-02-08 14:02:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:42,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:42,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:42,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:42,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:42,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 80 [2025-02-08 14:02:42,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:42,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 80 [2025-02-08 14:02:42,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:42,253 INFO L124 PetriNetUnfolderBase]: 105/285 cut-off events. [2025-02-08 14:02:42,254 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:02:42,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 285 events. 105/285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1037 event pairs, 85 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 457. Up to 221 conditions per place. [2025-02-08 14:02:42,256 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 37 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-02-08 14:02:42,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 223 flow [2025-02-08 14:02:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-02-08 14:02:42,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-08 14:02:42,259 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 133 flow. Second operand 3 states and 132 transitions. [2025-02-08 14:02:42,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 223 flow [2025-02-08 14:02:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:42,262 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 150 flow [2025-02-08 14:02:42,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-02-08 14:02:42,264 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-02-08 14:02:42,265 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 150 flow [2025-02-08 14:02:42,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:42,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:42,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:02:42,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:42,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -971678335, now seen corresponding path program 1 times [2025-02-08 14:02:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:42,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138722937] [2025-02-08 14:02:42,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:42,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:02:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:02:42,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:42,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138722937] [2025-02-08 14:02:42,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138722937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:42,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:42,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021176909] [2025-02-08 14:02:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:42,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:42,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:42,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:42,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:42,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 80 [2025-02-08 14:02:42,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:42,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 80 [2025-02-08 14:02:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:42,636 INFO L124 PetriNetUnfolderBase]: 105/283 cut-off events. [2025-02-08 14:02:42,637 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:02:42,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 283 events. 105/283 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1034 event pairs, 85 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 457. Up to 224 conditions per place. [2025-02-08 14:02:42,638 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 40 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-02-08 14:02:42,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 244 flow [2025-02-08 14:02:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-02-08 14:02:42,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48125 [2025-02-08 14:02:42,642 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 150 flow. Second operand 4 states and 154 transitions. [2025-02-08 14:02:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 244 flow [2025-02-08 14:02:42,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:02:42,644 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 168 flow [2025-02-08 14:02:42,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-02-08 14:02:42,646 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2025-02-08 14:02:42,646 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 168 flow [2025-02-08 14:02:42,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:42,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:42,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:02:42,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:42,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:42,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1012428986, now seen corresponding path program 1 times [2025-02-08 14:02:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:42,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541550966] [2025-02-08 14:02:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:42,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:02:42,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:02:42,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541550966] [2025-02-08 14:02:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541550966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:42,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:42,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743358831] [2025-02-08 14:02:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:42,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:42,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:42,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:42,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:42,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 80 [2025-02-08 14:02:42,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:42,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 80 [2025-02-08 14:02:42,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:42,921 INFO L124 PetriNetUnfolderBase]: 104/278 cut-off events. [2025-02-08 14:02:42,921 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 14:02:42,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 278 events. 104/278 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 912 event pairs, 85 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 490. Up to 211 conditions per place. [2025-02-08 14:02:42,924 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 35 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-02-08 14:02:42,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 241 flow [2025-02-08 14:02:42,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-02-08 14:02:42,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-02-08 14:02:42,927 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 168 flow. Second operand 4 states and 140 transitions. [2025-02-08 14:02:42,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 241 flow [2025-02-08 14:02:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 235 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:42,928 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 167 flow [2025-02-08 14:02:42,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-02-08 14:02:42,929 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2025-02-08 14:02:42,929 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 167 flow [2025-02-08 14:02:42,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:42,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:42,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:42,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:02:42,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:42,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash -804457665, now seen corresponding path program 1 times [2025-02-08 14:02:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404971093] [2025-02-08 14:02:42,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:42,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:02:42,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:02:42,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:43,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:43,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404971093] [2025-02-08 14:02:43,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404971093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:02:43,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242167848] [2025-02-08 14:02:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:43,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:43,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:02:43,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:02:43,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:02:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:02:43,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:43,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:43,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:02:43,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:02:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:43,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:02:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242167848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:02:43,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-08 14:02:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427263487] [2025-02-08 14:02:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:43,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:43,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:02:43,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 80 [2025-02-08 14:02:43,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:43,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:43,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 80 [2025-02-08 14:02:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:43,306 INFO L124 PetriNetUnfolderBase]: 104/276 cut-off events. [2025-02-08 14:02:43,307 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 14:02:43,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 276 events. 104/276 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 896 event pairs, 85 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 485. Up to 214 conditions per place. [2025-02-08 14:02:43,308 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 34 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2025-02-08 14:02:43,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 239 flow [2025-02-08 14:02:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-08 14:02:43,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-02-08 14:02:43,309 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 167 flow. Second operand 4 states and 144 transitions. [2025-02-08 14:02:43,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 239 flow [2025-02-08 14:02:43,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:43,311 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 163 flow [2025-02-08 14:02:43,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-02-08 14:02:43,311 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2025-02-08 14:02:43,312 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 163 flow [2025-02-08 14:02:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:43,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:43,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:43,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:02:43,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:43,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:43,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash 831616536, now seen corresponding path program 1 times [2025-02-08 14:02:43,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:43,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347607790] [2025-02-08 14:02:43,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:43,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:02:43,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:02:43,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:43,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347607790] [2025-02-08 14:02:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347607790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:02:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298638444] [2025-02-08 14:02:43,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:43,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:43,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:43,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:02:43,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:02:43,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:02:43,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:02:43,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:43,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:43,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:02:43,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:02:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:43,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:02:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298638444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:02:43,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:02:43,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 14:02:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182249819] [2025-02-08 14:02:43,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:02:43,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 14:02:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:43,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:02:43,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:02:43,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 80 [2025-02-08 14:02:43,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 163 flow. Second operand has 10 states, 10 states have (on average 28.0) internal successors, (280), 10 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:43,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:43,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 80 [2025-02-08 14:02:43,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:43,997 INFO L124 PetriNetUnfolderBase]: 106/302 cut-off events. [2025-02-08 14:02:43,998 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 14:02:43,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 302 events. 106/302 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1103 event pairs, 85 based on Foata normal form. 3/263 useless extension candidates. Maximal degree in co-relation 530. Up to 219 conditions per place. [2025-02-08 14:02:43,999 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 42 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2025-02-08 14:02:43,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 299 flow [2025-02-08 14:02:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:02:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:02:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2025-02-08 14:02:44,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2025-02-08 14:02:44,000 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 163 flow. Second operand 7 states and 236 transitions. [2025-02-08 14:02:44,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 299 flow [2025-02-08 14:02:44,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 279 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:44,002 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 209 flow [2025-02-08 14:02:44,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2025-02-08 14:02:44,003 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2025-02-08 14:02:44,003 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 209 flow [2025-02-08 14:02:44,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.0) internal successors, (280), 10 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:44,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:44,003 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:44,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 14:02:44,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:44,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:44,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2138458462, now seen corresponding path program 1 times [2025-02-08 14:02:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131875796] [2025-02-08 14:02:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:44,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:02:44,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:02:44,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:02:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131875796] [2025-02-08 14:02:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131875796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:44,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:02:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664375246] [2025-02-08 14:02:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:44,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:44,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:44,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:44,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2025-02-08 14:02:44,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:44,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:44,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2025-02-08 14:02:44,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:44,380 INFO L124 PetriNetUnfolderBase]: 106/307 cut-off events. [2025-02-08 14:02:44,380 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-08 14:02:44,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 307 events. 106/307 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1168 event pairs, 53 based on Foata normal form. 20/287 useless extension candidates. Maximal degree in co-relation 542. Up to 138 conditions per place. [2025-02-08 14:02:44,382 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 50 selfloop transitions, 5 changer transitions 4/82 dead transitions. [2025-02-08 14:02:44,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 355 flow [2025-02-08 14:02:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-02-08 14:02:44,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-02-08 14:02:44,383 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 209 flow. Second operand 3 states and 145 transitions. [2025-02-08 14:02:44,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 355 flow [2025-02-08 14:02:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 345 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:44,385 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 190 flow [2025-02-08 14:02:44,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2025-02-08 14:02:44,386 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-02-08 14:02:44,386 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 190 flow [2025-02-08 14:02:44,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:44,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:44,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:02:44,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:44,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash -433459159, now seen corresponding path program 1 times [2025-02-08 14:02:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433387932] [2025-02-08 14:02:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:44,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:02:44,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:02:44,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:44,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433387932] [2025-02-08 14:02:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433387932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:02:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008613570] [2025-02-08 14:02:44,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:44,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:44,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:44,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:02:44,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:02:44,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:02:44,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:02:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:44,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:02:44,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:02:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:44,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:02:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008613570] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:02:44,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:02:44,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 14:02:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599651399] [2025-02-08 14:02:44,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:02:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:02:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:44,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:02:44,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:02:44,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 80 [2025-02-08 14:02:44,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 190 flow. Second operand has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:44,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:44,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 80 [2025-02-08 14:02:44,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:44,955 INFO L124 PetriNetUnfolderBase]: 85/243 cut-off events. [2025-02-08 14:02:44,956 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 14:02:44,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 243 events. 85/243 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 704 event pairs, 68 based on Foata normal form. 2/228 useless extension candidates. Maximal degree in co-relation 473. Up to 172 conditions per place. [2025-02-08 14:02:44,960 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 35 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2025-02-08 14:02:44,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 268 flow [2025-02-08 14:02:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:02:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:02:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-02-08 14:02:44,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35208333333333336 [2025-02-08 14:02:44,962 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 190 flow. Second operand 6 states and 169 transitions. [2025-02-08 14:02:44,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 268 flow [2025-02-08 14:02:44,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:44,965 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 199 flow [2025-02-08 14:02:44,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-02-08 14:02:44,966 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2025-02-08 14:02:44,967 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 199 flow [2025-02-08 14:02:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.307692307692307) internal successors, (303), 13 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:44,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:44,968 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 14:02:44,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:02:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:45,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 293009982, now seen corresponding path program 1 times [2025-02-08 14:02:45,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:45,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366840099] [2025-02-08 14:02:45,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:45,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:02:45,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:02:45,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:45,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:02:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366840099] [2025-02-08 14:02:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366840099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:45,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:45,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593616720] [2025-02-08 14:02:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:45,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:45,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 80 [2025-02-08 14:02:45,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:45,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:45,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 80 [2025-02-08 14:02:45,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:45,331 INFO L124 PetriNetUnfolderBase]: 85/242 cut-off events. [2025-02-08 14:02:45,332 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-08 14:02:45,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 242 events. 85/242 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 697 event pairs, 68 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 460. Up to 180 conditions per place. [2025-02-08 14:02:45,333 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 32 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-02-08 14:02:45,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 279 flow [2025-02-08 14:02:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-02-08 14:02:45,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-02-08 14:02:45,335 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 199 flow. Second operand 4 states and 140 transitions. [2025-02-08 14:02:45,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 279 flow [2025-02-08 14:02:45,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 57 transitions, 268 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:02:45,338 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 212 flow [2025-02-08 14:02:45,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-02-08 14:02:45,339 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2025-02-08 14:02:45,339 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 212 flow [2025-02-08 14:02:45,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:45,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:45,339 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:45,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:02:45,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:45,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 778060293, now seen corresponding path program 2 times [2025-02-08 14:02:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:45,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337456950] [2025-02-08 14:02:45,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:02:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:45,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 14:02:45,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:02:45,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:02:45,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:02:45,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:02:45,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:02:45,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:02:45,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:45,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:02:45,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:02:45,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:02:45,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:02:45,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:02:45,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:02:45,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:02:45,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:02:45,414 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:02:45,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:02:45,415 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:45,416 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:02:45,416 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:02:45,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:02:45,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 117 transitions, 250 flow [2025-02-08 14:02:45,464 INFO L124 PetriNetUnfolderBase]: 19/144 cut-off events. [2025-02-08 14:02:45,465 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:02:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 144 events. 19/144 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 488 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 88. Up to 6 conditions per place. [2025-02-08 14:02:45,466 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 117 transitions, 250 flow [2025-02-08 14:02:45,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 117 transitions, 250 flow [2025-02-08 14:02:45,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:02:45,468 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;@4c3db65b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:02:45,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:02:45,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:02:45,470 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-08 14:02:45,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:02:45,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:45,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:02:45,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:45,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash -389119140, now seen corresponding path program 1 times [2025-02-08 14:02:45,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:45,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424117704] [2025-02-08 14:02:45,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:45,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:45,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:02:45,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:02:45,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:45,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424117704] [2025-02-08 14:02:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424117704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:45,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:02:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711947716] [2025-02-08 14:02:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:45,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:45,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:45,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:45,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:45,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 117 [2025-02-08 14:02:45,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:45,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:45,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 117 [2025-02-08 14:02:45,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:46,175 INFO L124 PetriNetUnfolderBase]: 5158/8409 cut-off events. [2025-02-08 14:02:46,175 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-02-08 14:02:46,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16193 conditions, 8409 events. 5158/8409 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 48526 event pairs, 4611 based on Foata normal form. 276/7038 useless extension candidates. Maximal degree in co-relation 11293. Up to 7680 conditions per place. [2025-02-08 14:02:46,209 INFO L140 encePairwiseOnDemand]: 106/117 looper letters, 54 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-02-08 14:02:46,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 304 flow [2025-02-08 14:02:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-02-08 14:02:46,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4757834757834758 [2025-02-08 14:02:46,211 INFO L175 Difference]: Start difference. First operand has 104 places, 117 transitions, 250 flow. Second operand 3 states and 167 transitions. [2025-02-08 14:02:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 304 flow [2025-02-08 14:02:46,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 88 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:02:46,212 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 196 flow [2025-02-08 14:02:46,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2025-02-08 14:02:46,213 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -18 predicate places. [2025-02-08 14:02:46,213 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 196 flow [2025-02-08 14:02:46,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:46,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:46,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:46,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:02:46,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash -131063464, now seen corresponding path program 1 times [2025-02-08 14:02:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138792617] [2025-02-08 14:02:46,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:46,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:02:46,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:02:46,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:46,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:46,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:46,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138792617] [2025-02-08 14:02:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138792617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:46,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:46,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:02:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786869174] [2025-02-08 14:02:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:46,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:46,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:46,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:46,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:46,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 117 [2025-02-08 14:02:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:46,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:46,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 117 [2025-02-08 14:02:46,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:47,030 INFO L124 PetriNetUnfolderBase]: 5159/8426 cut-off events. [2025-02-08 14:02:47,030 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-02-08 14:02:47,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16221 conditions, 8426 events. 5159/8426 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 48678 event pairs, 4611 based on Foata normal form. 2/6781 useless extension candidates. Maximal degree in co-relation 16159. Up to 7690 conditions per place. [2025-02-08 14:02:47,106 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 60 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-02-08 14:02:47,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 92 transitions, 332 flow [2025-02-08 14:02:47,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2025-02-08 14:02:47,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4843304843304843 [2025-02-08 14:02:47,108 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 196 flow. Second operand 3 states and 170 transitions. [2025-02-08 14:02:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 92 transitions, 332 flow [2025-02-08 14:02:47,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:47,110 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 213 flow [2025-02-08 14:02:47,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2025-02-08 14:02:47,111 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -17 predicate places. [2025-02-08 14:02:47,111 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 213 flow [2025-02-08 14:02:47,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:47,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:47,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:47,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:02:47,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash 922113590, now seen corresponding path program 1 times [2025-02-08 14:02:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145030417] [2025-02-08 14:02:47,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:47,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:02:47,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:02:47,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:47,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:47,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145030417] [2025-02-08 14:02:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145030417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106626336] [2025-02-08 14:02:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:47,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:47,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:47,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:47,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 117 [2025-02-08 14:02:47,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:47,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:47,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 117 [2025-02-08 14:02:47,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:47,793 INFO L124 PetriNetUnfolderBase]: 5159/8424 cut-off events. [2025-02-08 14:02:47,794 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-02-08 14:02:47,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16230 conditions, 8424 events. 5159/8424 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 48693 event pairs, 4611 based on Foata normal form. 2/6781 useless extension candidates. Maximal degree in co-relation 16159. Up to 7693 conditions per place. [2025-02-08 14:02:47,842 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 63 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-02-08 14:02:47,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 93 transitions, 353 flow [2025-02-08 14:02:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-02-08 14:02:47,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42094017094017094 [2025-02-08 14:02:47,845 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 213 flow. Second operand 4 states and 197 transitions. [2025-02-08 14:02:47,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 93 transitions, 353 flow [2025-02-08 14:02:47,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:02:47,846 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 231 flow [2025-02-08 14:02:47,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2025-02-08 14:02:47,847 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -13 predicate places. [2025-02-08 14:02:47,847 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 231 flow [2025-02-08 14:02:47,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:47,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:47,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:47,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:02:47,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:47,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 277416221, now seen corresponding path program 1 times [2025-02-08 14:02:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431750797] [2025-02-08 14:02:47,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:47,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:02:47,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:02:47,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:47,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:47,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431750797] [2025-02-08 14:02:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431750797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30925917] [2025-02-08 14:02:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:47,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:47,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:47,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:47,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 117 [2025-02-08 14:02:47,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:47,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:47,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 117 [2025-02-08 14:02:47,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:48,446 INFO L124 PetriNetUnfolderBase]: 5158/8419 cut-off events. [2025-02-08 14:02:48,447 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 14:02:48,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16227 conditions, 8419 events. 5158/8419 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 48520 event pairs, 4611 based on Foata normal form. 1/6777 useless extension candidates. Maximal degree in co-relation 16192. Up to 7680 conditions per place. [2025-02-08 14:02:48,471 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 58 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2025-02-08 14:02:48,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 91 transitions, 350 flow [2025-02-08 14:02:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-02-08 14:02:48,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2025-02-08 14:02:48,472 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 231 flow. Second operand 4 states and 183 transitions. [2025-02-08 14:02:48,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 91 transitions, 350 flow [2025-02-08 14:02:48,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 344 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:48,474 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 230 flow [2025-02-08 14:02:48,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-02-08 14:02:48,474 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -11 predicate places. [2025-02-08 14:02:48,474 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 230 flow [2025-02-08 14:02:48,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:48,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:48,474 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:48,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:02:48,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1466598420, now seen corresponding path program 1 times [2025-02-08 14:02:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:48,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447940439] [2025-02-08 14:02:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:48,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:02:48,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:02:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:48,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447940439] [2025-02-08 14:02:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447940439] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:02:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880376214] [2025-02-08 14:02:48,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:48,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:48,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:48,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:02:48,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:02:48,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:02:48,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:02:48,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:48,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:48,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:02:48,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:02:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:48,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:02:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880376214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:02:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-08 14:02:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756141607] [2025-02-08 14:02:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:48,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:48,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:02:48,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 117 [2025-02-08 14:02:48,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:48,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:48,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 117 [2025-02-08 14:02:48,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:49,280 INFO L124 PetriNetUnfolderBase]: 5158/8417 cut-off events. [2025-02-08 14:02:49,281 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-02-08 14:02:49,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16230 conditions, 8417 events. 5158/8417 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 48522 event pairs, 4611 based on Foata normal form. 2/6776 useless extension candidates. Maximal degree in co-relation 16187. Up to 7683 conditions per place. [2025-02-08 14:02:49,317 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 57 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-02-08 14:02:49,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 348 flow [2025-02-08 14:02:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-02-08 14:02:49,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3995726495726496 [2025-02-08 14:02:49,319 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 230 flow. Second operand 4 states and 187 transitions. [2025-02-08 14:02:49,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 348 flow [2025-02-08 14:02:49,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:49,321 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 226 flow [2025-02-08 14:02:49,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-02-08 14:02:49,322 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -13 predicate places. [2025-02-08 14:02:49,322 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 226 flow [2025-02-08 14:02:49,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:49,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:49,322 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:49,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:02:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 14:02:49,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:49,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:49,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1780088744, now seen corresponding path program 1 times [2025-02-08 14:02:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:49,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064150784] [2025-02-08 14:02:49,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:49,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:02:49,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:02:49,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:49,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064150784] [2025-02-08 14:02:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064150784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:02:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097827545] [2025-02-08 14:02:49,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:49,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:49,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:49,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:02:49,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:02:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:02:49,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:02:49,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:49,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:49,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:02:49,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:02:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:49,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:02:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097827545] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:02:49,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:02:49,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 14:02:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371219597] [2025-02-08 14:02:49,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:02:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 14:02:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:49,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 14:02:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 14:02:49,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 117 [2025-02-08 14:02:49,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 226 flow. Second operand has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:49,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:49,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 117 [2025-02-08 14:02:49,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:50,452 INFO L124 PetriNetUnfolderBase]: 5160/8443 cut-off events. [2025-02-08 14:02:50,452 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-02-08 14:02:50,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16275 conditions, 8443 events. 5160/8443 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 48828 event pairs, 4611 based on Foata normal form. 3/6803 useless extension candidates. Maximal degree in co-relation 16232. Up to 7688 conditions per place. [2025-02-08 14:02:50,488 INFO L140 encePairwiseOnDemand]: 110/117 looper letters, 65 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2025-02-08 14:02:50,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 99 transitions, 408 flow [2025-02-08 14:02:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:02:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:02:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 294 transitions. [2025-02-08 14:02:50,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2025-02-08 14:02:50,491 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 226 flow. Second operand 7 states and 294 transitions. [2025-02-08 14:02:50,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 99 transitions, 408 flow [2025-02-08 14:02:50,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 99 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:50,493 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 272 flow [2025-02-08 14:02:50,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-02-08 14:02:50,494 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2025-02-08 14:02:50,494 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 272 flow [2025-02-08 14:02:50,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:50,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:50,494 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:50,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:02:50,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 14:02:50,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:50,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2023316193, now seen corresponding path program 1 times [2025-02-08 14:02:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:50,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330586769] [2025-02-08 14:02:50,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:02:50,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:02:50,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:50,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:02:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330586769] [2025-02-08 14:02:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330586769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:02:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587201036] [2025-02-08 14:02:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:50,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:50,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 117 [2025-02-08 14:02:50,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:50,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:50,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 117 [2025-02-08 14:02:50,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:51,279 INFO L124 PetriNetUnfolderBase]: 5975/9793 cut-off events. [2025-02-08 14:02:51,280 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-02-08 14:02:51,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18831 conditions, 9793 events. 5975/9793 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 61295 event pairs, 2779 based on Foata normal form. 59/8104 useless extension candidates. Maximal degree in co-relation 18786. Up to 6499 conditions per place. [2025-02-08 14:02:51,326 INFO L140 encePairwiseOnDemand]: 108/117 looper letters, 99 selfloop transitions, 6 changer transitions 4/138 dead transitions. [2025-02-08 14:02:51,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 138 transitions, 586 flow [2025-02-08 14:02:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-02-08 14:02:51,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2025-02-08 14:02:51,328 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 272 flow. Second operand 3 states and 213 transitions. [2025-02-08 14:02:51,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 138 transitions, 586 flow [2025-02-08 14:02:51,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 138 transitions, 576 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:51,331 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 290 flow [2025-02-08 14:02:51,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2025-02-08 14:02:51,332 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -5 predicate places. [2025-02-08 14:02:51,333 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 290 flow [2025-02-08 14:02:51,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:51,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:51,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 14:02:51,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:51,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash 817979147, now seen corresponding path program 1 times [2025-02-08 14:02:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477654712] [2025-02-08 14:02:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:51,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:02:51,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:02:51,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:02:51,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:51,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477654712] [2025-02-08 14:02:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477654712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:51,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:51,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778891380] [2025-02-08 14:02:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:51,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:51,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:51,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:51,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 117 [2025-02-08 14:02:51,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:51,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:51,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 117 [2025-02-08 14:02:51,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:52,028 INFO L124 PetriNetUnfolderBase]: 5180/8538 cut-off events. [2025-02-08 14:02:52,029 INFO L125 PetriNetUnfolderBase]: For 1910/1910 co-relation queries the response was YES. [2025-02-08 14:02:52,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17642 conditions, 8538 events. 5180/8538 cut-off events. For 1910/1910 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 52952 event pairs, 2382 based on Foata normal form. 365/7699 useless extension candidates. Maximal degree in co-relation 17597. Up to 5321 conditions per place. [2025-02-08 14:02:52,095 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 97 selfloop transitions, 6 changer transitions 2/134 dead transitions. [2025-02-08 14:02:52,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 134 transitions, 584 flow [2025-02-08 14:02:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-08 14:02:52,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5106837606837606 [2025-02-08 14:02:52,096 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 290 flow. Second operand 4 states and 239 transitions. [2025-02-08 14:02:52,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 134 transitions, 584 flow [2025-02-08 14:02:52,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:02:52,109 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 288 flow [2025-02-08 14:02:52,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-02-08 14:02:52,110 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -6 predicate places. [2025-02-08 14:02:52,110 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 288 flow [2025-02-08 14:02:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:52,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:52,111 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:52,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:02:52,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:52,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash -412449700, now seen corresponding path program 1 times [2025-02-08 14:02:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756552325] [2025-02-08 14:02:52,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:52,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 14:02:52,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:02:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:52,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:02:52,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756552325] [2025-02-08 14:02:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756552325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:02:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259501393] [2025-02-08 14:02:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:52,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:52,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:52,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:52,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 117 [2025-02-08 14:02:52,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:52,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:52,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 117 [2025-02-08 14:02:52,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:52,937 INFO L124 PetriNetUnfolderBase]: 4466/7279 cut-off events. [2025-02-08 14:02:52,937 INFO L125 PetriNetUnfolderBase]: For 846/846 co-relation queries the response was YES. [2025-02-08 14:02:52,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15460 conditions, 7279 events. 4466/7279 cut-off events. For 846/846 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 39999 event pairs, 3198 based on Foata normal form. 1/6549 useless extension candidates. Maximal degree in co-relation 15415. Up to 5471 conditions per place. [2025-02-08 14:02:52,980 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 88 selfloop transitions, 7 changer transitions 7/129 dead transitions. [2025-02-08 14:02:52,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 560 flow [2025-02-08 14:02:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:02:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:02:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2025-02-08 14:02:52,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5669515669515669 [2025-02-08 14:02:52,986 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 288 flow. Second operand 3 states and 199 transitions. [2025-02-08 14:02:52,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 560 flow [2025-02-08 14:02:52,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 129 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:52,998 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 275 flow [2025-02-08 14:02:52,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2025-02-08 14:02:52,999 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2025-02-08 14:02:52,999 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 275 flow [2025-02-08 14:02:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:52,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:52,999 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-08 14:02:53,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:02:53,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1138052386, now seen corresponding path program 1 times [2025-02-08 14:02:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413289926] [2025-02-08 14:02:53,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:53,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:02:53,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:02:53,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:53,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:02:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413289926] [2025-02-08 14:02:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413289926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562398021] [2025-02-08 14:02:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:53,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:53,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:53,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 117 [2025-02-08 14:02:53,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:53,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:53,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 117 [2025-02-08 14:02:53,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:53,371 INFO L124 PetriNetUnfolderBase]: 3499/5720 cut-off events. [2025-02-08 14:02:53,372 INFO L125 PetriNetUnfolderBase]: For 4954/4954 co-relation queries the response was YES. [2025-02-08 14:02:53,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 5720 events. 3499/5720 cut-off events. For 4954/4954 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 30744 event pairs, 3126 based on Foata normal form. 1/5134 useless extension candidates. Maximal degree in co-relation 13702. Up to 5241 conditions per place. [2025-02-08 14:02:53,394 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 56 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2025-02-08 14:02:53,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 84 transitions, 403 flow [2025-02-08 14:02:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2025-02-08 14:02:53,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38675213675213677 [2025-02-08 14:02:53,396 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 275 flow. Second operand 4 states and 181 transitions. [2025-02-08 14:02:53,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 84 transitions, 403 flow [2025-02-08 14:02:53,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:53,400 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 288 flow [2025-02-08 14:02:53,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2025-02-08 14:02:53,400 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -11 predicate places. [2025-02-08 14:02:53,400 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 288 flow [2025-02-08 14:02:53,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:53,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:53,401 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:53,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 14:02:53,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:53,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1227152044, now seen corresponding path program 1 times [2025-02-08 14:02:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47209779] [2025-02-08 14:02:53,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:53,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:02:53,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:02:53,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:53,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47209779] [2025-02-08 14:02:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47209779] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:02:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126283056] [2025-02-08 14:02:53,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:02:53,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:53,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:02:53,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:02:53,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:02:53,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:02:53,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:53,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:53,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:02:53,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:02:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:53,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:02:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126283056] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:02:53,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:02:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 14:02:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033700310] [2025-02-08 14:02:53,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:02:53,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:02:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:53,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:02:53,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:02:53,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 117 [2025-02-08 14:02:53,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 288 flow. Second operand has 13 states, 13 states have (on average 28.384615384615383) internal successors, (369), 13 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:53,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:53,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 117 [2025-02-08 14:02:53,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:54,213 INFO L124 PetriNetUnfolderBase]: 3498/5714 cut-off events. [2025-02-08 14:02:54,214 INFO L125 PetriNetUnfolderBase]: For 3841/3841 co-relation queries the response was YES. [2025-02-08 14:02:54,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12985 conditions, 5714 events. 3498/5714 cut-off events. For 3841/3841 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 30555 event pairs, 3126 based on Foata normal form. 2/5129 useless extension candidates. Maximal degree in co-relation 12937. Up to 5230 conditions per place. [2025-02-08 14:02:54,235 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 56 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-02-08 14:02:54,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 85 transitions, 406 flow [2025-02-08 14:02:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:02:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:02:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2025-02-08 14:02:54,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31054131054131057 [2025-02-08 14:02:54,236 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 288 flow. Second operand 6 states and 218 transitions. [2025-02-08 14:02:54,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 85 transitions, 406 flow [2025-02-08 14:02:54,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 85 transitions, 386 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 14:02:54,239 INFO L231 Difference]: Finished difference. Result has 95 places, 83 transitions, 285 flow [2025-02-08 14:02:54,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=95, PETRI_TRANSITIONS=83} [2025-02-08 14:02:54,240 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2025-02-08 14:02:54,240 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 83 transitions, 285 flow [2025-02-08 14:02:54,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.384615384615383) internal successors, (369), 13 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:54,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:54,240 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:54,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:02:54,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 14:02:54,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1706291688, now seen corresponding path program 2 times [2025-02-08 14:02:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306134534] [2025-02-08 14:02:54,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:02:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:54,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 14:02:54,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:02:54,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:02:54,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:02:54,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:02:54,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:02:54,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:02:54,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:54,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:02:54,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:02:54,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:02:54,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:02:54,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:02:54,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:02:54,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:02:54,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:02:54,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:02:54,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:02:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 14:02:54,489 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:54,490 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:02:54,490 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:02:54,525 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:02:54,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 154 transitions, 335 flow [2025-02-08 14:02:54,540 INFO L124 PetriNetUnfolderBase]: 31/223 cut-off events. [2025-02-08 14:02:54,540 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:02:54,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 223 events. 31/223 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 875 event pairs, 1 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 152. Up to 12 conditions per place. [2025-02-08 14:02:54,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 154 transitions, 335 flow [2025-02-08 14:02:54,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 154 transitions, 335 flow [2025-02-08 14:02:54,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:02:54,546 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;@4c3db65b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:02:54,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:02:54,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:02:54,547 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-02-08 14:02:54,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:02:54,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:54,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:02:54,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:02:54,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash -128234212, now seen corresponding path program 1 times [2025-02-08 14:02:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863987928] [2025-02-08 14:02:54,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:54,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:02:54,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:02:54,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:54,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:02:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863987928] [2025-02-08 14:02:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863987928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:54,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:54,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:02:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397632713] [2025-02-08 14:02:54,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:54,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:02:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:54,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:02:54,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:02:54,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 154 [2025-02-08 14:02:54,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 154 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:02:54,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:54,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 154 [2025-02-08 14:02:54,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:03:06,470 INFO L124 PetriNetUnfolderBase]: 159616/225227 cut-off events. [2025-02-08 14:03:06,471 INFO L125 PetriNetUnfolderBase]: For 5732/5732 co-relation queries the response was YES. [2025-02-08 14:03:06,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439051 conditions, 225227 events. 159616/225227 cut-off events. For 5732/5732 co-relation queries the response was YES. Maximal size of possible extension queue 3487. Compared 1589265 event pairs, 147903 based on Foata normal form. 8341/191480 useless extension candidates. Maximal degree in co-relation 148398. Up to 211092 conditions per place. [2025-02-08 14:03:07,503 INFO L140 encePairwiseOnDemand]: 141/154 looper letters, 75 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-02-08 14:03:07,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 407 flow [2025-02-08 14:03:07,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:03:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:03:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2025-02-08 14:03:07,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44372294372294374 [2025-02-08 14:03:07,508 INFO L175 Difference]: Start difference. First operand has 135 places, 154 transitions, 335 flow. Second operand 3 states and 205 transitions. [2025-02-08 14:03:07,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 407 flow [2025-02-08 14:03:07,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:03:07,511 INFO L231 Difference]: Finished difference. Result has 109 places, 113 transitions, 257 flow [2025-02-08 14:03:07,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=109, PETRI_TRANSITIONS=113} [2025-02-08 14:03:07,515 INFO L279 CegarLoopForPetriNet]: 135 programPoint places, -26 predicate places. [2025-02-08 14:03:07,516 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 113 transitions, 257 flow [2025-02-08 14:03:07,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:03:07,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:03:07,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:03:07,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 14:03:07,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:03:07,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:03:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1998826254, now seen corresponding path program 1 times [2025-02-08 14:03:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:03:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858347669] [2025-02-08 14:03:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:03:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:03:07,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:03:07,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:03:07,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:03:07,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:03:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:03:07,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:03:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858347669] [2025-02-08 14:03:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858347669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:03:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:03:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:03:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645900093] [2025-02-08 14:03:07,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:03:07,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:03:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:03:07,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:03:07,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:03:07,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 154 [2025-02-08 14:03:07,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 113 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:03:07,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:03:07,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 154 [2025-02-08 14:03:07,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand