./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c --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/weaver/popl20-three-array-max.wvr.c -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 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:14:08,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:14:08,975 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:14:08,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:14:08,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:14:09,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:14:09,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:14:09,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:14:09,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:14:09,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:14:09,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:14:09,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:14:09,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:14:09,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:14:09,026 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:14:09,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:14:09,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:14:09,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:14:09,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:14:09,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:14:09,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:14:09,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:14:09,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:14:09,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:14:09,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:14:09,029 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2025-02-08 14:14:09,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:14:09,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:14:09,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:14:09,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:14:09,349 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:14:09,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-02-08 14:14:10,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c1ebf1f/9fbe4b6da7324fe5ad7b89d16650817a/FLAG90ba9084a [2025-02-08 14:14:11,006 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:14:11,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-02-08 14:14:11,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c1ebf1f/9fbe4b6da7324fe5ad7b89d16650817a/FLAG90ba9084a [2025-02-08 14:14:11,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c1ebf1f/9fbe4b6da7324fe5ad7b89d16650817a [2025-02-08 14:14:11,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:14:11,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:14:11,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:14:11,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:14:11,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:14:11,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8a9f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11, skipping insertion in model container [2025-02-08 14:14:11,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:14:11,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:14:11,277 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:14:11,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:14:11,325 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:14:11,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11 WrapperNode [2025-02-08 14:14:11,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:14:11,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:14:11,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:14:11,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:14:11,334 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:14:11" (1/1) ... [2025-02-08 14:14:11,344 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:14:11" (1/1) ... [2025-02-08 14:14:11,370 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-02-08 14:14:11,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:14:11,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:14:11,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:14:11,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:14:11,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,405 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-08 14:14:11,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:14:11,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:14:11,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:14:11,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:14:11,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (1/1) ... [2025-02-08 14:14:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:14:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:11,447 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:14:11,448 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:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:14:11,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:14:11,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:14:11,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:14:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:14:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:14:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:14:11,472 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:14:11,575 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:14:11,577 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:14:11,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: assume 1 + ~i~1#1 <= 2147483647; [2025-02-08 14:14:11,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: assume !(1 + ~i~1#1 <= 2147483647); [2025-02-08 14:14:11,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: ~p~0 := 1 + ~i~1#1; [2025-02-08 14:14:11,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume 1 + ~i~1#1 >= -2147483648; [2025-02-08 14:14:11,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume !(1 + ~i~1#1 >= -2147483648); [2025-02-08 14:14:11,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: [2025-02-08 14:14:11,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-1: havoc #t~post9#1; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-2: assume 1 + #t~post9#1 <= 2147483647; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-2: assume !(1 + #t~post9#1 <= 2147483647); [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-3: ~i~1#1 := 1 + #t~post9#1; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-4: assume 1 + #t~post9#1 >= -2147483648; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-4: assume !(1 + #t~post9#1 >= -2147483648); [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61-5: #t~post9#1 := ~i~1#1; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc #t~ret8#1; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-1: havoc #t~mem7#1; [2025-02-08 14:14:11,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-2: havoc #t~mem6#1; [2025-02-08 14:14:11,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-3: SUMMARY for call write~int#1(#t~ret8#1, ~C~0.base, ~C~0.offset + 4 * ~i~1#1, 4); srcloc: null [2025-02-08 14:14:11,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-4: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 14:14:11,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-5: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:14:11,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-6: havoc plus_#t~short32#1, plus_#t~short33#1, plus_~a#1, plus_~b#1; [2025-02-08 14:14:11,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-7: #t~ret8#1 := plus_#res#1; [2025-02-08 14:14:12,145 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:14:12,145 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:14:12,494 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L133 is not an error location. [2025-02-08 14:14:12,497 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:14:12,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:14:12,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:14:12 BoogieIcfgContainer [2025-02-08 14:14:12,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:14:12,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:14:12,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:14:12,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:14:12,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:14:11" (1/3) ... [2025-02-08 14:14:12,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f59a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:14:12, skipping insertion in model container [2025-02-08 14:14:12,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:14:11" (2/3) ... [2025-02-08 14:14:12,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f59a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:14:12, skipping insertion in model container [2025-02-08 14:14:12,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:14:12" (3/3) ... [2025-02-08 14:14:12,510 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-02-08 14:14:12,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:14:12,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 89 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-02-08 14:14:12,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:14:12,626 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:14:12,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 98 transitions, 217 flow [2025-02-08 14:14:12,710 INFO L124 PetriNetUnfolderBase]: 10/95 cut-off events. [2025-02-08 14:14:12,712 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:14:12,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 95 events. 10/95 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 211 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2025-02-08 14:14:12,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 98 transitions, 217 flow [2025-02-08 14:14:12,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 206 flow [2025-02-08 14:14:12,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:14:12,738 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;@aa73baa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:14:12,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-02-08 14:14:12,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:14:12,742 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:14:12,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:14:12,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:12,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:14:12,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:12,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash 884406, now seen corresponding path program 1 times [2025-02-08 14:14:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:12,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436699724] [2025-02-08 14:14:12,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:14:12,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:14:12,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:12,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:13,019 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:14:13,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:13,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436699724] [2025-02-08 14:14:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436699724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:13,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:14:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132387142] [2025-02-08 14:14:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:14:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:13,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:14:13,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:14:13,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:13,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:14:13,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:13,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:13,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:13,612 INFO L124 PetriNetUnfolderBase]: 1050/2019 cut-off events. [2025-02-08 14:14:13,612 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-02-08 14:14:13,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 2019 events. 1050/2019 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12680 event pairs, 806 based on Foata normal form. 3/1535 useless extension candidates. Maximal degree in co-relation 3161. Up to 1443 conditions per place. [2025-02-08 14:14:13,638 INFO L140 encePairwiseOnDemand]: 80/98 looper letters, 50 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2025-02-08 14:14:13,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 101 transitions, 340 flow [2025-02-08 14:14:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-02-08 14:14:13,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-02-08 14:14:13,658 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 206 flow. Second operand 4 states and 244 transitions. [2025-02-08 14:14:13,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 101 transitions, 340 flow [2025-02-08 14:14:13,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 101 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:14:13,673 INFO L231 Difference]: Finished difference. Result has 92 places, 101 transitions, 278 flow [2025-02-08 14:14:13,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=92, PETRI_TRANSITIONS=101} [2025-02-08 14:14:13,679 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2025-02-08 14:14:13,679 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 101 transitions, 278 flow [2025-02-08 14:14:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:14:13,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:13,680 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:14:13,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:14:13,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 578297729, now seen corresponding path program 1 times [2025-02-08 14:14:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109331709] [2025-02-08 14:14:13,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:14:13,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:14:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:13,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109331709] [2025-02-08 14:14:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109331709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660739824] [2025-02-08 14:14:13,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:13,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:13,873 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:14:13,874 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:14:13,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:14:13,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:14:13,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:13,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:13,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:14:13,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:14,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:14:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660739824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:14,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:14:14,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:14:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794092058] [2025-02-08 14:14:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:14,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:14:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:14,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:14:14,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:14:14,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:14,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 101 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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:14:14,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:14,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:14,451 INFO L124 PetriNetUnfolderBase]: 1050/2016 cut-off events. [2025-02-08 14:14:14,451 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-08 14:14:14,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 2016 events. 1050/2016 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12609 event pairs, 806 based on Foata normal form. 3/1537 useless extension candidates. Maximal degree in co-relation 3464. Up to 1428 conditions per place. [2025-02-08 14:14:14,470 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 40 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2025-02-08 14:14:14,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 98 transitions, 380 flow [2025-02-08 14:14:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:14:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:14:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 324 transitions. [2025-02-08 14:14:14,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-02-08 14:14:14,478 INFO L175 Difference]: Start difference. First operand has 92 places, 101 transitions, 278 flow. Second operand 6 states and 324 transitions. [2025-02-08 14:14:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 98 transitions, 380 flow [2025-02-08 14:14:14,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:14:14,481 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 300 flow [2025-02-08 14:14:14,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2025-02-08 14:14:14,483 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2025-02-08 14:14:14,483 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 300 flow [2025-02-08 14:14:14,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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:14:14,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:14,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:14:14,493 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:14:14,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:14,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:14,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 579411972, now seen corresponding path program 1 times [2025-02-08 14:14:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460084883] [2025-02-08 14:14:14,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:14,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:14:14,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:14:14,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:14,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:14,824 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:14:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460084883] [2025-02-08 14:14:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460084883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:14:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025335359] [2025-02-08 14:14:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:14:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:14:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:14:14,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 98 [2025-02-08 14:14:14,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:14:14,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:14,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 98 [2025-02-08 14:14:14,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:15,177 INFO L124 PetriNetUnfolderBase]: 1051/2033 cut-off events. [2025-02-08 14:14:15,177 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:14:15,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 2033 events. 1051/2033 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12610 event pairs, 806 based on Foata normal form. 4/1554 useless extension candidates. Maximal degree in co-relation 3500. Up to 1443 conditions per place. [2025-02-08 14:14:15,197 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 61 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2025-02-08 14:14:15,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 103 transitions, 452 flow [2025-02-08 14:14:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-02-08 14:14:15,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-02-08 14:14:15,200 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 300 flow. Second operand 4 states and 220 transitions. [2025-02-08 14:14:15,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 103 transitions, 452 flow [2025-02-08 14:14:15,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 103 transitions, 414 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 14:14:15,206 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 326 flow [2025-02-08 14:14:15,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-02-08 14:14:15,208 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -1 predicate places. [2025-02-08 14:14:15,208 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 326 flow [2025-02-08 14:14:15,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:14:15,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:15,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:15,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:14:15,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:15,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 781902708, now seen corresponding path program 1 times [2025-02-08 14:14:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798499362] [2025-02-08 14:14:15,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:15,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:14:15,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:14:15,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:15,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:15,336 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:14:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798499362] [2025-02-08 14:14:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798499362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:14:15,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120885999] [2025-02-08 14:14:15,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:15,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:14:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:15,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:14:15,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:14:15,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 98 [2025-02-08 14:14:15,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:14:15,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:15,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 98 [2025-02-08 14:14:15,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:15,611 INFO L124 PetriNetUnfolderBase]: 1050/2032 cut-off events. [2025-02-08 14:14:15,611 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-02-08 14:14:15,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3580 conditions, 2032 events. 1050/2032 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12617 event pairs, 806 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 3512. Up to 1447 conditions per place. [2025-02-08 14:14:15,625 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 54 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-02-08 14:14:15,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 434 flow [2025-02-08 14:14:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:14:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:14:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2025-02-08 14:14:15,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-02-08 14:14:15,626 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 326 flow. Second operand 3 states and 198 transitions. [2025-02-08 14:14:15,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 434 flow [2025-02-08 14:14:15,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:14:15,634 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 326 flow [2025-02-08 14:14:15,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2025-02-08 14:14:15,635 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2025-02-08 14:14:15,635 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 326 flow [2025-02-08 14:14:15,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:14:15,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:15,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:14:15,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:14:15,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:15,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 747361179, now seen corresponding path program 1 times [2025-02-08 14:14:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934840213] [2025-02-08 14:14:15,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:15,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:14:15,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:14:15,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:15,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:15,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934840213] [2025-02-08 14:14:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934840213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865514377] [2025-02-08 14:14:15,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:15,742 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:14:15,745 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:14:15,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:14:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:14:15,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:15,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:14:15,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:15,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865514377] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:15,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:15,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:14:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963045841] [2025-02-08 14:14:15,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:15,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:14:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:15,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:14:15,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:14:15,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:15,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 326 flow. Second operand has 12 states, 12 states have (on average 45.083333333333336) internal successors, (541), 12 states have internal predecessors, (541), 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:14:15,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:15,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:15,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:16,362 INFO L124 PetriNetUnfolderBase]: 1059/2068 cut-off events. [2025-02-08 14:14:16,362 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-02-08 14:14:16,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 2068 events. 1059/2068 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12820 event pairs, 806 based on Foata normal form. 9/1593 useless extension candidates. Maximal degree in co-relation 3673. Up to 1448 conditions per place. [2025-02-08 14:14:16,375 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 49 selfloop transitions, 37 changer transitions 0/127 dead transitions. [2025-02-08 14:14:16,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 127 transitions, 639 flow [2025-02-08 14:14:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:14:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:14:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 532 transitions. [2025-02-08 14:14:16,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-02-08 14:14:16,377 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 326 flow. Second operand 10 states and 532 transitions. [2025-02-08 14:14:16,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 127 transitions, 639 flow [2025-02-08 14:14:16,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 127 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:14:16,384 INFO L231 Difference]: Finished difference. Result has 106 places, 127 transitions, 589 flow [2025-02-08 14:14:16,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=589, PETRI_PLACES=106, PETRI_TRANSITIONS=127} [2025-02-08 14:14:16,385 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2025-02-08 14:14:16,385 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 589 flow [2025-02-08 14:14:16,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.083333333333336) internal successors, (541), 12 states have internal predecessors, (541), 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:14:16,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:16,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:16,397 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:14:16,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:16,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:16,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash -438163777, now seen corresponding path program 1 times [2025-02-08 14:14:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:16,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544801253] [2025-02-08 14:14:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:16,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:14:16,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:14:16,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:16,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:16,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544801253] [2025-02-08 14:14:16,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544801253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:16,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:16,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:14:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873770654] [2025-02-08 14:14:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:16,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:14:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:16,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:14:16,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:14:16,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 98 [2025-02-08 14:14:16,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 589 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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:14:16,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:16,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 98 [2025-02-08 14:14:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:16,980 INFO L124 PetriNetUnfolderBase]: 1057/2066 cut-off events. [2025-02-08 14:14:16,980 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-02-08 14:14:16,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 2066 events. 1057/2066 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12731 event pairs, 806 based on Foata normal form. 2/1590 useless extension candidates. Maximal degree in co-relation 3644. Up to 1461 conditions per place. [2025-02-08 14:14:16,994 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 69 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-02-08 14:14:16,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 125 transitions, 737 flow [2025-02-08 14:14:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-02-08 14:14:16,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6454081632653061 [2025-02-08 14:14:16,995 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 589 flow. Second operand 4 states and 253 transitions. [2025-02-08 14:14:16,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 125 transitions, 737 flow [2025-02-08 14:14:16,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 125 transitions, 689 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-02-08 14:14:16,999 INFO L231 Difference]: Finished difference. Result has 106 places, 125 transitions, 551 flow [2025-02-08 14:14:16,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=551, PETRI_PLACES=106, PETRI_TRANSITIONS=125} [2025-02-08 14:14:17,000 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2025-02-08 14:14:17,000 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 125 transitions, 551 flow [2025-02-08 14:14:17,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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:14:17,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:17,000 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:14:17,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:14:17,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash -658543930, now seen corresponding path program 2 times [2025-02-08 14:14:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598463481] [2025-02-08 14:14:17,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:17,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:14:17,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:14:17,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:14:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:14:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598463481] [2025-02-08 14:14:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598463481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549464446] [2025-02-08 14:14:17,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:17,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:17,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:17,062 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:14:17,064 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:14:17,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:14:17,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:14:17,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:14:17,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:17,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:14:17,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:14:17,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:14:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549464446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:17,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:14:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210737239] [2025-02-08 14:14:17,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:17,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:14:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:17,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:14:17,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:14:17,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:17,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 125 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:14:17,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:17,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:17,496 INFO L124 PetriNetUnfolderBase]: 1057/2065 cut-off events. [2025-02-08 14:14:17,497 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-02-08 14:14:17,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 2065 events. 1057/2065 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12730 event pairs, 806 based on Foata normal form. 1/1590 useless extension candidates. Maximal degree in co-relation 3631. Up to 1465 conditions per place. [2025-02-08 14:14:17,509 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 68 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2025-02-08 14:14:17,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 124 transitions, 707 flow [2025-02-08 14:14:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-02-08 14:14:17,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-08 14:14:17,512 INFO L175 Difference]: Start difference. First operand has 106 places, 125 transitions, 551 flow. Second operand 4 states and 224 transitions. [2025-02-08 14:14:17,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 124 transitions, 707 flow [2025-02-08 14:14:17,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 124 transitions, 683 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:14:17,517 INFO L231 Difference]: Finished difference. Result has 105 places, 124 transitions, 547 flow [2025-02-08 14:14:17,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=547, PETRI_PLACES=105, PETRI_TRANSITIONS=124} [2025-02-08 14:14:17,520 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2025-02-08 14:14:17,520 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 124 transitions, 547 flow [2025-02-08 14:14:17,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:14:17,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:17,520 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:14:17,529 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:14:17,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:17,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:17,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash 113328369, now seen corresponding path program 1 times [2025-02-08 14:14:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:17,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742002135] [2025-02-08 14:14:17,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:17,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:14:17,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:14:17,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:18,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742002135] [2025-02-08 14:14:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742002135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583282362] [2025-02-08 14:14:18,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:18,190 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:14:18,192 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:14:18,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:14:18,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:14:18,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:18,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:18,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:14:18,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:18,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:18,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:18,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:18,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:18,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:18,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:14:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:18,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:18,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_99 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_99) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2025-02-08 14:14:18,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:18,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 14:14:18,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:18,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-02-08 14:14:18,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-08 14:14:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-08 14:14:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583282362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:18,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:18,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 14:14:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504688755] [2025-02-08 14:14:18,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:18,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 14:14:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:18,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 14:14:18,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-02-08 14:14:18,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 98 [2025-02-08 14:14:18,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 124 transitions, 547 flow. Second operand has 14 states, 14 states have (on average 33.785714285714285) internal successors, (473), 14 states have internal predecessors, (473), 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:14:18,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:18,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 98 [2025-02-08 14:14:18,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:19,324 INFO L124 PetriNetUnfolderBase]: 1055/2068 cut-off events. [2025-02-08 14:14:19,324 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-08 14:14:19,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3760 conditions, 2068 events. 1055/2068 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12732 event pairs, 806 based on Foata normal form. 0/1588 useless extension candidates. Maximal degree in co-relation 3669. Up to 1427 conditions per place. [2025-02-08 14:14:19,343 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 83 selfloop transitions, 24 changer transitions 0/132 dead transitions. [2025-02-08 14:14:19,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 132 transitions, 777 flow [2025-02-08 14:14:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:14:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:14:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 430 transitions. [2025-02-08 14:14:19,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39888682745825604 [2025-02-08 14:14:19,346 INFO L175 Difference]: Start difference. First operand has 105 places, 124 transitions, 547 flow. Second operand 11 states and 430 transitions. [2025-02-08 14:14:19,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 132 transitions, 777 flow [2025-02-08 14:14:19,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 747 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:14:19,353 INFO L231 Difference]: Finished difference. Result has 111 places, 123 transitions, 563 flow [2025-02-08 14:14:19,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=563, PETRI_PLACES=111, PETRI_TRANSITIONS=123} [2025-02-08 14:14:19,354 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 17 predicate places. [2025-02-08 14:14:19,354 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 123 transitions, 563 flow [2025-02-08 14:14:19,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 33.785714285714285) internal successors, (473), 14 states have internal predecessors, (473), 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:14:19,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:19,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:19,364 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:14:19,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 14:14:19,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -781845416, now seen corresponding path program 1 times [2025-02-08 14:14:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22483331] [2025-02-08 14:14:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:19,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:14:19,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:14:19,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:19,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22483331] [2025-02-08 14:14:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22483331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:19,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814000216] [2025-02-08 14:14:19,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:19,899 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:14:19,902 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:14:19,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:14:19,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:14:19,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:19,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:19,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:14:19,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:20,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:20,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:20,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:20,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:20,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:14:20,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:14:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:20,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:20,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_126 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_126) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2025-02-08 14:14:20,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:20,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-08 14:14:20,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:20,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 14:14:20,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-08 14:14:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-08 14:14:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814000216] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:20,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 14:14:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078904862] [2025-02-08 14:14:20,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:20,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 14:14:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:20,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 14:14:20,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-02-08 14:14:20,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 98 [2025-02-08 14:14:20,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 123 transitions, 563 flow. Second operand has 14 states, 14 states have (on average 33.857142857142854) internal successors, (474), 14 states have internal predecessors, (474), 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:14:20,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:20,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 98 [2025-02-08 14:14:20,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:20,833 INFO L124 PetriNetUnfolderBase]: 1055/2067 cut-off events. [2025-02-08 14:14:20,833 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-02-08 14:14:20,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3766 conditions, 2067 events. 1055/2067 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12736 event pairs, 806 based on Foata normal form. 1/1591 useless extension candidates. Maximal degree in co-relation 3671. Up to 1431 conditions per place. [2025-02-08 14:14:20,848 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 76 selfloop transitions, 25 changer transitions 0/126 dead transitions. [2025-02-08 14:14:20,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 126 transitions, 769 flow [2025-02-08 14:14:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:14:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:14:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 422 transitions. [2025-02-08 14:14:20,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3914656771799629 [2025-02-08 14:14:20,850 INFO L175 Difference]: Start difference. First operand has 111 places, 123 transitions, 563 flow. Second operand 11 states and 422 transitions. [2025-02-08 14:14:20,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 126 transitions, 769 flow [2025-02-08 14:14:20,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 126 transitions, 742 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:14:20,855 INFO L231 Difference]: Finished difference. Result has 116 places, 122 transitions, 582 flow [2025-02-08 14:14:20,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=582, PETRI_PLACES=116, PETRI_TRANSITIONS=122} [2025-02-08 14:14:20,856 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 22 predicate places. [2025-02-08 14:14:20,856 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 122 transitions, 582 flow [2025-02-08 14:14:20,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 33.857142857142854) internal successors, (474), 14 states have internal predecessors, (474), 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:14:20,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:20,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:20,874 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:14:21,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:21,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:21,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1532596335, now seen corresponding path program 1 times [2025-02-08 14:14:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636933617] [2025-02-08 14:14:21,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:21,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:14:21,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:14:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636933617] [2025-02-08 14:14:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636933617] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337109] [2025-02-08 14:14:21,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:21,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:21,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:21,532 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:14:21,535 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:14:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:14:21,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:14:21,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:21,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:21,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 14:14:21,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:21,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:21,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:21,684 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 14:14:21,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 14:14:21,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:21,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:21,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:21,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:21,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 14:14:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:21,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:22,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:22,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-08 14:14:22,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:22,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-02-08 14:14:22,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-02-08 14:14:22,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-02-08 14:14:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:22,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:22,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:22,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-02-08 14:14:22,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427225118] [2025-02-08 14:14:22,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 14:14:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:22,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 14:14:22,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=248, Unknown=6, NotChecked=0, Total=306 [2025-02-08 14:14:22,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 98 [2025-02-08 14:14:22,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 122 transitions, 582 flow. Second operand has 18 states, 18 states have (on average 29.61111111111111) internal successors, (533), 18 states have internal predecessors, (533), 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:14:22,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:22,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 98 [2025-02-08 14:14:22,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:22,950 INFO L124 PetriNetUnfolderBase]: 1054/2063 cut-off events. [2025-02-08 14:14:22,950 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-02-08 14:14:22,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 2063 events. 1054/2063 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12718 event pairs, 806 based on Foata normal form. 1/1590 useless extension candidates. Maximal degree in co-relation 3673. Up to 1428 conditions per place. [2025-02-08 14:14:22,961 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 78 selfloop transitions, 28 changer transitions 0/127 dead transitions. [2025-02-08 14:14:22,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 802 flow [2025-02-08 14:14:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:14:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 14:14:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 475 transitions. [2025-02-08 14:14:22,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3462099125364432 [2025-02-08 14:14:22,965 INFO L175 Difference]: Start difference. First operand has 116 places, 122 transitions, 582 flow. Second operand 14 states and 475 transitions. [2025-02-08 14:14:22,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 802 flow [2025-02-08 14:14:22,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 127 transitions, 750 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-08 14:14:22,969 INFO L231 Difference]: Finished difference. Result has 120 places, 121 transitions, 594 flow [2025-02-08 14:14:22,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=594, PETRI_PLACES=120, PETRI_TRANSITIONS=121} [2025-02-08 14:14:22,970 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 26 predicate places. [2025-02-08 14:14:22,970 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 121 transitions, 594 flow [2025-02-08 14:14:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.61111111111111) internal successors, (533), 18 states have internal predecessors, (533), 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:14:22,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:22,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:22,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 14:14:23,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 14:14:23,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:23,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash 265846938, now seen corresponding path program 1 times [2025-02-08 14:14:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:23,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301524687] [2025-02-08 14:14:23,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:23,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:14:23,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:14:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:23,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301524687] [2025-02-08 14:14:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301524687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118202926] [2025-02-08 14:14:23,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:23,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:23,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:23,542 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:14:23,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 14:14:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:14:23,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:14:23,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:23,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:23,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 14:14:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:23,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:23,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:23,693 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 14:14:23,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 14:14:23,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:14:23,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:23,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:23,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:14:23,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:14:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:14:23,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:23,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_185 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-02-08 14:14:24,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:24,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 14:14:24,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:24,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2025-02-08 14:14:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-02-08 14:14:24,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:14:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 14:14:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118202926] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:24,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-02-08 14:14:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648730800] [2025-02-08 14:14:24,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:24,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:14:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:24,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:14:24,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2025-02-08 14:14:24,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 98 [2025-02-08 14:14:24,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 121 transitions, 594 flow. Second operand has 19 states, 19 states have (on average 29.57894736842105) internal successors, (562), 19 states have internal predecessors, (562), 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:14:24,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:24,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 98 [2025-02-08 14:14:24,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:25,033 INFO L124 PetriNetUnfolderBase]: 1054/2063 cut-off events. [2025-02-08 14:14:25,033 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-02-08 14:14:25,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 2063 events. 1054/2063 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12716 event pairs, 806 based on Foata normal form. 4/1595 useless extension candidates. Maximal degree in co-relation 3714. Up to 1432 conditions per place. [2025-02-08 14:14:25,045 INFO L140 encePairwiseOnDemand]: 77/98 looper letters, 72 selfloop transitions, 32 changer transitions 1/126 dead transitions. [2025-02-08 14:14:25,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 126 transitions, 826 flow [2025-02-08 14:14:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 14:14:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 14:14:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 552 transitions. [2025-02-08 14:14:25,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33133253301320525 [2025-02-08 14:14:25,049 INFO L175 Difference]: Start difference. First operand has 120 places, 121 transitions, 594 flow. Second operand 17 states and 552 transitions. [2025-02-08 14:14:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 126 transitions, 826 flow [2025-02-08 14:14:25,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 126 transitions, 804 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 14:14:25,054 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 665 flow [2025-02-08 14:14:25,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=665, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2025-02-08 14:14:25,056 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 40 predicate places. [2025-02-08 14:14:25,056 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 665 flow [2025-02-08 14:14:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 29.57894736842105) internal successors, (562), 19 states have internal predecessors, (562), 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:14:25,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:25,057 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:25,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 14:14:25,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:25,261 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash -672584014, now seen corresponding path program 1 times [2025-02-08 14:14:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171602186] [2025-02-08 14:14:25,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:25,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:14:25,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:14:25,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:25,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 14:14:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171602186] [2025-02-08 14:14:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171602186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858055920] [2025-02-08 14:14:25,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:25,405 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:14:25,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 14:14:25,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:14:25,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:14:25,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:25,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:25,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:14:25,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:14:25,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:14:25,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858055920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:25,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:25,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-02-08 14:14:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036525700] [2025-02-08 14:14:25,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:25,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 14:14:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:25,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 14:14:25,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-08 14:14:25,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:25,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 665 flow. Second operand has 21 states, 21 states have (on average 45.285714285714285) internal successors, (951), 21 states have internal predecessors, (951), 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:14:25,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:25,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:25,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:26,710 INFO L124 PetriNetUnfolderBase]: 2095/4074 cut-off events. [2025-02-08 14:14:26,710 INFO L125 PetriNetUnfolderBase]: For 365/365 co-relation queries the response was YES. [2025-02-08 14:14:26,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 4074 events. 2095/4074 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 26852 event pairs, 1612 based on Foata normal form. 2/3155 useless extension candidates. Maximal degree in co-relation 7320. Up to 1449 conditions per place. [2025-02-08 14:14:26,731 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 87 selfloop transitions, 46 changer transitions 0/171 dead transitions. [2025-02-08 14:14:26,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 171 transitions, 1152 flow [2025-02-08 14:14:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:14:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:14:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 589 transitions. [2025-02-08 14:14:26,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463821892393321 [2025-02-08 14:14:26,734 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 665 flow. Second operand 11 states and 589 transitions. [2025-02-08 14:14:26,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 171 transitions, 1152 flow [2025-02-08 14:14:26,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 1086 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-02-08 14:14:26,741 INFO L231 Difference]: Finished difference. Result has 135 places, 130 transitions, 760 flow [2025-02-08 14:14:26,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=760, PETRI_PLACES=135, PETRI_TRANSITIONS=130} [2025-02-08 14:14:26,743 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 41 predicate places. [2025-02-08 14:14:26,743 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 130 transitions, 760 flow [2025-02-08 14:14:26,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 45.285714285714285) internal successors, (951), 21 states have internal predecessors, (951), 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:14:26,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:26,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:26,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:14:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:26,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1391833666, now seen corresponding path program 1 times [2025-02-08 14:14:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530306577] [2025-02-08 14:14:26,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:26,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:14:26,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:14:26,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530306577] [2025-02-08 14:14:27,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530306577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:27,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:27,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:14:27,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066467609] [2025-02-08 14:14:27,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:27,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:14:27,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:27,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:14:27,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:14:27,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 98 [2025-02-08 14:14:27,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 130 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 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:14:27,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:27,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 98 [2025-02-08 14:14:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:27,487 INFO L124 PetriNetUnfolderBase]: 2095/4062 cut-off events. [2025-02-08 14:14:27,487 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2025-02-08 14:14:27,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 4062 events. 2095/4062 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 26941 event pairs, 1612 based on Foata normal form. 2/3126 useless extension candidates. Maximal degree in co-relation 7337. Up to 2903 conditions per place. [2025-02-08 14:14:27,512 INFO L140 encePairwiseOnDemand]: 84/98 looper letters, 85 selfloop transitions, 20 changer transitions 0/132 dead transitions. [2025-02-08 14:14:27,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 974 flow [2025-02-08 14:14:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:14:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:14:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-02-08 14:14:27,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4608843537414966 [2025-02-08 14:14:27,514 INFO L175 Difference]: Start difference. First operand has 135 places, 130 transitions, 760 flow. Second operand 6 states and 271 transitions. [2025-02-08 14:14:27,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 974 flow [2025-02-08 14:14:27,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 893 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 14:14:27,519 INFO L231 Difference]: Finished difference. Result has 134 places, 132 transitions, 749 flow [2025-02-08 14:14:27,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=749, PETRI_PLACES=134, PETRI_TRANSITIONS=132} [2025-02-08 14:14:27,520 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 40 predicate places. [2025-02-08 14:14:27,520 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 749 flow [2025-02-08 14:14:27,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 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:14:27,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:27,521 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-02-08 14:14:27,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:14:27,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:27,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1547641529, now seen corresponding path program 2 times [2025-02-08 14:14:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302475209] [2025-02-08 14:14:27,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:27,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 14:14:27,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-08 14:14:27,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:14:27,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 14:14:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302475209] [2025-02-08 14:14:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302475209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466691681] [2025-02-08 14:14:27,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:27,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:14:27,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 14:14:27,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 14:14:27,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-08 14:14:27,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:14:27,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:27,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:14:27,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 14:14:27,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 14:14:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466691681] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:27,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:27,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 14:14:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886869692] [2025-02-08 14:14:27,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:27,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:14:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:27,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:14:27,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:14:27,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:27,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 132 transitions, 749 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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:14:27,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:27,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:27,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:28,183 INFO L124 PetriNetUnfolderBase]: 2097/4060 cut-off events. [2025-02-08 14:14:28,183 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-02-08 14:14:28,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 4060 events. 2097/4060 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 26890 event pairs, 1612 based on Foata normal form. 2/3124 useless extension candidates. Maximal degree in co-relation 7308. Up to 2871 conditions per place. [2025-02-08 14:14:28,204 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 52 selfloop transitions, 40 changer transitions 0/130 dead transitions. [2025-02-08 14:14:28,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 130 transitions, 913 flow [2025-02-08 14:14:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:14:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:14:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-02-08 14:14:28,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448979591836735 [2025-02-08 14:14:28,205 INFO L175 Difference]: Start difference. First operand has 134 places, 132 transitions, 749 flow. Second operand 5 states and 267 transitions. [2025-02-08 14:14:28,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 130 transitions, 913 flow [2025-02-08 14:14:28,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 853 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-02-08 14:14:28,210 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 749 flow [2025-02-08 14:14:28,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=749, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2025-02-08 14:14:28,212 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 34 predicate places. [2025-02-08 14:14:28,212 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 749 flow [2025-02-08 14:14:28,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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:14:28,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:28,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:28,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:14:28,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:28,413 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:28,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2043545628, now seen corresponding path program 1 times [2025-02-08 14:14:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:28,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143717113] [2025-02-08 14:14:28,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:28,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:14:28,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:14:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:28,471 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:14:28,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143717113] [2025-02-08 14:14:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143717113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:14:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264454663] [2025-02-08 14:14:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:28,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:14:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:28,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:14:28,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:14:28,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 98 [2025-02-08 14:14:28,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 749 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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:14:28,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:28,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 98 [2025-02-08 14:14:28,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:29,359 INFO L124 PetriNetUnfolderBase]: 4477/8010 cut-off events. [2025-02-08 14:14:29,359 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-02-08 14:14:29,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14605 conditions, 8010 events. 4477/8010 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 57340 event pairs, 1806 based on Foata normal form. 228/6328 useless extension candidates. Maximal degree in co-relation 14560. Up to 4820 conditions per place. [2025-02-08 14:14:29,409 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 127 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2025-02-08 14:14:29,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 167 transitions, 1089 flow [2025-02-08 14:14:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2025-02-08 14:14:29,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877 [2025-02-08 14:14:29,412 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 749 flow. Second operand 4 states and 278 transitions. [2025-02-08 14:14:29,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 167 transitions, 1089 flow [2025-02-08 14:14:29,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 167 transitions, 1014 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:14:29,418 INFO L231 Difference]: Finished difference. Result has 130 places, 133 transitions, 703 flow [2025-02-08 14:14:29,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=703, PETRI_PLACES=130, PETRI_TRANSITIONS=133} [2025-02-08 14:14:29,418 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2025-02-08 14:14:29,418 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 133 transitions, 703 flow [2025-02-08 14:14:29,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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:14:29,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:29,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:29,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:14:29,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:29,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1011248701, now seen corresponding path program 1 times [2025-02-08 14:14:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366197601] [2025-02-08 14:14:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:29,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 14:14:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:14:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:14:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366197601] [2025-02-08 14:14:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366197601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886690702] [2025-02-08 14:14:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:29,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:29,537 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:14:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 14:14:29,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 14:14:29,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:14:29,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:29,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:29,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:14:29,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:14:29,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:14:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886690702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:29,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 14:14:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449702093] [2025-02-08 14:14:29,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:29,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 14:14:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:29,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:14:29,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:14:29,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2025-02-08 14:14:29,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 133 transitions, 703 flow. Second operand has 15 states, 15 states have (on average 45.06666666666667) internal successors, (676), 15 states have internal predecessors, (676), 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:14:29,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:29,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2025-02-08 14:14:29,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:30,518 INFO L124 PetriNetUnfolderBase]: 2461/4301 cut-off events. [2025-02-08 14:14:30,518 INFO L125 PetriNetUnfolderBase]: For 1846/2057 co-relation queries the response was YES. [2025-02-08 14:14:30,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9755 conditions, 4301 events. 2461/4301 cut-off events. For 1846/2057 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 25074 event pairs, 1711 based on Foata normal form. 0/3518 useless extension candidates. Maximal degree in co-relation 9708. Up to 2566 conditions per place. [2025-02-08 14:14:30,539 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 108 selfloop transitions, 45 changer transitions 0/190 dead transitions. [2025-02-08 14:14:30,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 190 transitions, 1234 flow [2025-02-08 14:14:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:14:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:14:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 584 transitions. [2025-02-08 14:14:30,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5417439703153989 [2025-02-08 14:14:30,542 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 703 flow. Second operand 11 states and 584 transitions. [2025-02-08 14:14:30,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 190 transitions, 1234 flow [2025-02-08 14:14:30,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 190 transitions, 1225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:14:30,550 INFO L231 Difference]: Finished difference. Result has 141 places, 135 transitions, 806 flow [2025-02-08 14:14:30,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=806, PETRI_PLACES=141, PETRI_TRANSITIONS=135} [2025-02-08 14:14:30,551 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 47 predicate places. [2025-02-08 14:14:30,551 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 135 transitions, 806 flow [2025-02-08 14:14:30,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.06666666666667) internal successors, (676), 15 states have internal predecessors, (676), 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:14:30,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:30,552 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:30,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 14:14:30,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 14:14:30,753 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1892765185, now seen corresponding path program 1 times [2025-02-08 14:14:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163527837] [2025-02-08 14:14:30,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:30,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:14:30,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:14:30,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:30,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163527837] [2025-02-08 14:14:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163527837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275406743] [2025-02-08 14:14:30,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:30,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:30,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:30,868 INFO L229 MonitoredProcess]: Starting monitored process 12 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:14:30,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 14:14:30,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:14:30,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:14:30,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:30,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:30,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:14:30,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:31,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275406743] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:31,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 14:14:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375780522] [2025-02-08 14:14:31,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:31,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 14:14:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:31,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:14:31,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:14:31,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:14:31,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 135 transitions, 806 flow. Second operand has 15 states, 15 states have (on average 46.0) internal successors, (690), 15 states have internal predecessors, (690), 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:14:31,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:31,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:14:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:31,794 INFO L124 PetriNetUnfolderBase]: 1904/3750 cut-off events. [2025-02-08 14:14:31,794 INFO L125 PetriNetUnfolderBase]: For 1553/1650 co-relation queries the response was YES. [2025-02-08 14:14:31,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8179 conditions, 3750 events. 1904/3750 cut-off events. For 1553/1650 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 25867 event pairs, 1374 based on Foata normal form. 44/3152 useless extension candidates. Maximal degree in co-relation 8130. Up to 2225 conditions per place. [2025-02-08 14:14:31,811 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 98 selfloop transitions, 45 changer transitions 0/181 dead transitions. [2025-02-08 14:14:31,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 181 transitions, 1269 flow [2025-02-08 14:14:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:14:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:14:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 591 transitions. [2025-02-08 14:14:31,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5482374768089053 [2025-02-08 14:14:31,813 INFO L175 Difference]: Start difference. First operand has 141 places, 135 transitions, 806 flow. Second operand 11 states and 591 transitions. [2025-02-08 14:14:31,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 181 transitions, 1269 flow [2025-02-08 14:14:31,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 181 transitions, 1185 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 14:14:31,824 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 832 flow [2025-02-08 14:14:31,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=832, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-02-08 14:14:31,824 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 51 predicate places. [2025-02-08 14:14:31,825 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 832 flow [2025-02-08 14:14:31,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 46.0) internal successors, (690), 15 states have internal predecessors, (690), 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:14:31,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:31,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:31,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 14:14:32,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 14:14:32,026 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:32,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1172437069, now seen corresponding path program 1 times [2025-02-08 14:14:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760905702] [2025-02-08 14:14:32,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:32,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:14:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:14:32,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:32,085 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:14:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760905702] [2025-02-08 14:14:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760905702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:32,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:14:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075355957] [2025-02-08 14:14:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:32,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:14:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:32,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:14:32,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:14:32,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 98 [2025-02-08 14:14:32,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 832 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:14:32,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:32,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 98 [2025-02-08 14:14:32,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:32,885 INFO L124 PetriNetUnfolderBase]: 4293/7335 cut-off events. [2025-02-08 14:14:32,885 INFO L125 PetriNetUnfolderBase]: For 5588/5885 co-relation queries the response was YES. [2025-02-08 14:14:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17819 conditions, 7335 events. 4293/7335 cut-off events. For 5588/5885 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 47308 event pairs, 2213 based on Foata normal form. 127/6209 useless extension candidates. Maximal degree in co-relation 17734. Up to 3868 conditions per place. [2025-02-08 14:14:32,936 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 155 selfloop transitions, 3 changer transitions 0/193 dead transitions. [2025-02-08 14:14:32,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 193 transitions, 1379 flow [2025-02-08 14:14:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2025-02-08 14:14:32,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066326530612245 [2025-02-08 14:14:32,938 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 832 flow. Second operand 4 states and 277 transitions. [2025-02-08 14:14:32,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 193 transitions, 1379 flow [2025-02-08 14:14:32,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 193 transitions, 1295 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 14:14:32,951 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 770 flow [2025-02-08 14:14:32,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=770, PETRI_PLACES=142, PETRI_TRANSITIONS=139} [2025-02-08 14:14:32,952 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 48 predicate places. [2025-02-08 14:14:32,952 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 770 flow [2025-02-08 14:14:32,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:14:32,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:32,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:32,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:14:32,953 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 79390970, now seen corresponding path program 2 times [2025-02-08 14:14:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:32,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929826004] [2025-02-08 14:14:32,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:32,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-08 14:14:32,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:32,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:14:32,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:14:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929826004] [2025-02-08 14:14:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929826004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935336890] [2025-02-08 14:14:33,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:33,482 INFO L229 MonitoredProcess]: Starting monitored process 13 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:14:33,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 14:14:33,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-08 14:14:33,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:33,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:14:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:33,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 14:14:33,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:33,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:33,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:33,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:33,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:33,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:33,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:14:33,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:34,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:34,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-08 14:14:34,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:34,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-02-08 14:14:34,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 14:14:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:14:34,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935336890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:34,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:34,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 26 [2025-02-08 14:14:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241666126] [2025-02-08 14:14:34,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:34,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 14:14:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:34,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 14:14:34,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=622, Unknown=3, NotChecked=0, Total=702 [2025-02-08 14:14:34,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 98 [2025-02-08 14:14:34,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 770 flow. Second operand has 27 states, 27 states have (on average 41.851851851851855) internal successors, (1130), 27 states have internal predecessors, (1130), 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:14:34,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:34,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 98 [2025-02-08 14:14:34,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:36,439 INFO L124 PetriNetUnfolderBase]: 6949/10793 cut-off events. [2025-02-08 14:14:36,440 INFO L125 PetriNetUnfolderBase]: For 9808/10835 co-relation queries the response was YES. [2025-02-08 14:14:36,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29083 conditions, 10793 events. 6949/10793 cut-off events. For 9808/10835 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 63782 event pairs, 970 based on Foata normal form. 135/8695 useless extension candidates. Maximal degree in co-relation 28962. Up to 3330 conditions per place. [2025-02-08 14:14:36,631 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 245 selfloop transitions, 56 changer transitions 0/335 dead transitions. [2025-02-08 14:14:36,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 335 transitions, 2222 flow [2025-02-08 14:14:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 14:14:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-08 14:14:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1446 transitions. [2025-02-08 14:14:36,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4759710335747202 [2025-02-08 14:14:36,635 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 770 flow. Second operand 31 states and 1446 transitions. [2025-02-08 14:14:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 335 transitions, 2222 flow [2025-02-08 14:14:36,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 335 transitions, 2206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:14:36,655 INFO L231 Difference]: Finished difference. Result has 172 places, 156 transitions, 1043 flow [2025-02-08 14:14:36,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1043, PETRI_PLACES=172, PETRI_TRANSITIONS=156} [2025-02-08 14:14:36,655 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 78 predicate places. [2025-02-08 14:14:36,655 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 156 transitions, 1043 flow [2025-02-08 14:14:36,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 41.851851851851855) internal successors, (1130), 27 states have internal predecessors, (1130), 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:14:36,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:36,656 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:36,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 14:14:36,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:36,927 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 79390971, now seen corresponding path program 1 times [2025-02-08 14:14:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459318196] [2025-02-08 14:14:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:36,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:14:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:37,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459318196] [2025-02-08 14:14:37,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459318196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256799184] [2025-02-08 14:14:37,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:37,615 INFO L229 MonitoredProcess]: Starting monitored process 14 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:14:37,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 14:14:37,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:14:37,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:37,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:37,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:37,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 14:14:37,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:37,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:37,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 14:14:37,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:37,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:37,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:37,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:14:37,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:38,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 14:14:38,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:38,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-02-08 14:14:38,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 14:14:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:14:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256799184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:38,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2025-02-08 14:14:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21749880] [2025-02-08 14:14:38,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:38,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 14:14:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:38,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 14:14:38,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=668, Unknown=6, NotChecked=0, Total=756 [2025-02-08 14:14:38,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 98 [2025-02-08 14:14:38,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 156 transitions, 1043 flow. Second operand has 28 states, 28 states have (on average 41.964285714285715) internal successors, (1175), 28 states have internal predecessors, (1175), 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:14:38,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:38,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 98 [2025-02-08 14:14:38,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:40,457 INFO L124 PetriNetUnfolderBase]: 6149/9866 cut-off events. [2025-02-08 14:14:40,457 INFO L125 PetriNetUnfolderBase]: For 10101/10765 co-relation queries the response was YES. [2025-02-08 14:14:40,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27337 conditions, 9866 events. 6149/9866 cut-off events. For 10101/10765 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 59311 event pairs, 1443 based on Foata normal form. 112/8443 useless extension candidates. Maximal degree in co-relation 27229. Up to 5808 conditions per place. [2025-02-08 14:14:40,510 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 140 selfloop transitions, 51 changer transitions 0/225 dead transitions. [2025-02-08 14:14:40,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 225 transitions, 1711 flow [2025-02-08 14:14:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 14:14:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 14:14:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 915 transitions. [2025-02-08 14:14:40,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46683673469387754 [2025-02-08 14:14:40,513 INFO L175 Difference]: Start difference. First operand has 172 places, 156 transitions, 1043 flow. Second operand 20 states and 915 transitions. [2025-02-08 14:14:40,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 225 transitions, 1711 flow [2025-02-08 14:14:40,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 225 transitions, 1639 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-02-08 14:14:40,536 INFO L231 Difference]: Finished difference. Result has 180 places, 157 transitions, 1092 flow [2025-02-08 14:14:40,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1092, PETRI_PLACES=180, PETRI_TRANSITIONS=157} [2025-02-08 14:14:40,536 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 86 predicate places. [2025-02-08 14:14:40,536 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 157 transitions, 1092 flow [2025-02-08 14:14:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 41.964285714285715) internal successors, (1175), 28 states have internal predecessors, (1175), 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:14:40,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:40,537 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:40,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 14:14:40,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:40,741 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:40,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 79390973, now seen corresponding path program 1 times [2025-02-08 14:14:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:40,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019806766] [2025-02-08 14:14:40,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:40,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:40,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:14:40,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:40,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:40,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:14:41,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019806766] [2025-02-08 14:14:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019806766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527676092] [2025-02-08 14:14:41,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:41,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:41,420 INFO L229 MonitoredProcess]: Starting monitored process 15 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:14:41,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 14:14:41,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:14:41,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:41,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:41,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:41,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 14:14:41,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:41,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:41,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:41,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:41,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:41,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:41,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:14:41,686 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 14:14:41,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-08 14:14:41,765 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-08 14:14:41,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-02-08 14:14:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:41,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:41,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:41,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2025-02-08 14:14:41,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< (+ (select v_arrayElimArr_7 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-02-08 14:14:42,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| Int)) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_458) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)))) (< (+ 2147483648 (select v_arrayElimArr_7 4)) 0))) is different from false [2025-02-08 14:14:42,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:42,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-08 14:14:42,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:42,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 147 [2025-02-08 14:14:42,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-08 14:14:42,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:42,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2025-02-08 14:14:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 14:14:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527676092] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:42,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-02-08 14:14:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241367727] [2025-02-08 14:14:42,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 14:14:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:42,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:14:42,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=416, Unknown=11, NotChecked=86, Total=600 [2025-02-08 14:14:42,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:14:42,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 157 transitions, 1092 flow. Second operand has 25 states, 25 states have (on average 42.96) internal successors, (1074), 25 states have internal predecessors, (1074), 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:14:42,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:42,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:14:42,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:43,606 INFO L124 PetriNetUnfolderBase]: 4772/7736 cut-off events. [2025-02-08 14:14:43,607 INFO L125 PetriNetUnfolderBase]: For 8761/9377 co-relation queries the response was YES. [2025-02-08 14:14:43,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22549 conditions, 7736 events. 4772/7736 cut-off events. For 8761/9377 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 46770 event pairs, 1407 based on Foata normal form. 135/7150 useless extension candidates. Maximal degree in co-relation 22438. Up to 4116 conditions per place. [2025-02-08 14:14:43,650 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 136 selfloop transitions, 52 changer transitions 0/223 dead transitions. [2025-02-08 14:14:43,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 223 transitions, 1772 flow [2025-02-08 14:14:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:14:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 14:14:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 677 transitions. [2025-02-08 14:14:43,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4934402332361516 [2025-02-08 14:14:43,651 INFO L175 Difference]: Start difference. First operand has 180 places, 157 transitions, 1092 flow. Second operand 14 states and 677 transitions. [2025-02-08 14:14:43,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 223 transitions, 1772 flow [2025-02-08 14:14:43,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 223 transitions, 1701 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-08 14:14:43,672 INFO L231 Difference]: Finished difference. Result has 181 places, 161 transitions, 1203 flow [2025-02-08 14:14:43,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1203, PETRI_PLACES=181, PETRI_TRANSITIONS=161} [2025-02-08 14:14:43,673 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 87 predicate places. [2025-02-08 14:14:43,673 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 161 transitions, 1203 flow [2025-02-08 14:14:43,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 42.96) internal successors, (1074), 25 states have internal predecessors, (1074), 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:14:43,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:43,673 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:43,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 14:14:43,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 14:14:43,875 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:43,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash 79390974, now seen corresponding path program 1 times [2025-02-08 14:14:43,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:43,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822592955] [2025-02-08 14:14:43,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:43,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:14:43,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:43,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:14:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822592955] [2025-02-08 14:14:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822592955] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519998894] [2025-02-08 14:14:44,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:44,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:44,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:44,368 INFO L229 MonitoredProcess]: Starting monitored process 16 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:14:44,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 14:14:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:14:44,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:14:44,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:44,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:44,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 14:14:44,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:44,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:14:44,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 14:14:44,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:14:44,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:14:44,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:14:44,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:14:44,673 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 14:14:44,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 14:14:44,755 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-08 14:14:44,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-02-08 14:14:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:14:44,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:44,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:44,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-02-08 14:14:45,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648) (< 2147483647 (select v_arrayElimArr_9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2025-02-08 14:14:45,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648) (< 2147483647 (select v_arrayElimArr_9 4)))) is different from false [2025-02-08 14:14:45,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_500) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648) (< 2147483647 (select v_arrayElimArr_9 4)))) is different from false [2025-02-08 14:14:45,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:45,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-08 14:14:45,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:45,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 65 [2025-02-08 14:14:45,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:14:45,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2025-02-08 14:14:45,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-08 14:14:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 14:14:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519998894] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:45,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2025-02-08 14:14:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139384030] [2025-02-08 14:14:45,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 14:14:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:45,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 14:14:45,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=562, Unknown=3, NotChecked=150, Total=812 [2025-02-08 14:14:45,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:14:45,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 161 transitions, 1203 flow. Second operand has 29 states, 29 states have (on average 42.793103448275865) internal successors, (1241), 29 states have internal predecessors, (1241), 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:14:45,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:45,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:14:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:46,608 INFO L124 PetriNetUnfolderBase]: 4182/7495 cut-off events. [2025-02-08 14:14:46,608 INFO L125 PetriNetUnfolderBase]: For 12199/12465 co-relation queries the response was YES. [2025-02-08 14:14:46,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22249 conditions, 7495 events. 4182/7495 cut-off events. For 12199/12465 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 48811 event pairs, 1499 based on Foata normal form. 41/6995 useless extension candidates. Maximal degree in co-relation 22136. Up to 3194 conditions per place. [2025-02-08 14:14:46,657 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 135 selfloop transitions, 52 changer transitions 0/222 dead transitions. [2025-02-08 14:14:46,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 222 transitions, 1830 flow [2025-02-08 14:14:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:14:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 14:14:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 676 transitions. [2025-02-08 14:14:46,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2025-02-08 14:14:46,658 INFO L175 Difference]: Start difference. First operand has 181 places, 161 transitions, 1203 flow. Second operand 14 states and 676 transitions. [2025-02-08 14:14:46,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 222 transitions, 1830 flow [2025-02-08 14:14:46,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 222 transitions, 1776 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:14:46,683 INFO L231 Difference]: Finished difference. Result has 189 places, 160 transitions, 1251 flow [2025-02-08 14:14:46,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1251, PETRI_PLACES=189, PETRI_TRANSITIONS=160} [2025-02-08 14:14:46,684 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 95 predicate places. [2025-02-08 14:14:46,684 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 160 transitions, 1251 flow [2025-02-08 14:14:46,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 42.793103448275865) internal successors, (1241), 29 states have internal predecessors, (1241), 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:14:46,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:46,684 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:46,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 14:14:46,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:46,885 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:46,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -715583774, now seen corresponding path program 2 times [2025-02-08 14:14:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581272298] [2025-02-08 14:14:46,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:14:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:46,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 14:14:46,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:14:46,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:14:46,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:14:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581272298] [2025-02-08 14:14:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581272298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:14:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252043925] [2025-02-08 14:14:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:46,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:14:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:46,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:14:46,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:14:46,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 98 [2025-02-08 14:14:46,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 160 transitions, 1251 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:14:46,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:46,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 98 [2025-02-08 14:14:46,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:47,666 INFO L124 PetriNetUnfolderBase]: 4455/7642 cut-off events. [2025-02-08 14:14:47,666 INFO L125 PetriNetUnfolderBase]: For 17696/18172 co-relation queries the response was YES. [2025-02-08 14:14:47,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24179 conditions, 7642 events. 4455/7642 cut-off events. For 17696/18172 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 48922 event pairs, 1098 based on Foata normal form. 234/7376 useless extension candidates. Maximal degree in co-relation 24067. Up to 2566 conditions per place. [2025-02-08 14:14:47,709 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 152 selfloop transitions, 9 changer transitions 0/197 dead transitions. [2025-02-08 14:14:47,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 197 transitions, 1785 flow [2025-02-08 14:14:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:14:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:14:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-02-08 14:14:47,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6581632653061225 [2025-02-08 14:14:47,710 INFO L175 Difference]: Start difference. First operand has 189 places, 160 transitions, 1251 flow. Second operand 4 states and 258 transitions. [2025-02-08 14:14:47,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 197 transitions, 1785 flow [2025-02-08 14:14:47,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 197 transitions, 1657 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-08 14:14:47,732 INFO L231 Difference]: Finished difference. Result has 178 places, 159 transitions, 1161 flow [2025-02-08 14:14:47,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1161, PETRI_PLACES=178, PETRI_TRANSITIONS=159} [2025-02-08 14:14:47,733 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 84 predicate places. [2025-02-08 14:14:47,733 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 159 transitions, 1161 flow [2025-02-08 14:14:47,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:14:47,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:47,733 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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:14:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 14:14:47,734 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash -708259658, now seen corresponding path program 1 times [2025-02-08 14:14:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:47,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792651607] [2025-02-08 14:14:47,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:47,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:47,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 14:14:47,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 14:14:47,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:47,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:14:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792651607] [2025-02-08 14:14:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792651607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943726975] [2025-02-08 14:14:47,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:47,802 INFO L229 MonitoredProcess]: Starting monitored process 17 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:14:47,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 14:14:47,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 14:14:47,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 14:14:47,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:47,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:47,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:14:47,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 14:14:48,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 14:14:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943726975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-02-08 14:14:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044705021] [2025-02-08 14:14:48,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:48,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 14:14:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:48,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:14:48,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-02-08 14:14:48,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:14:48,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 159 transitions, 1161 flow. Second operand has 23 states, 23 states have (on average 44.17391304347826) internal successors, (1016), 23 states have internal predecessors, (1016), 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:14:48,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:48,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:14:48,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:49,464 INFO L124 PetriNetUnfolderBase]: 4873/8881 cut-off events. [2025-02-08 14:14:49,464 INFO L125 PetriNetUnfolderBase]: For 18395/18867 co-relation queries the response was YES. [2025-02-08 14:14:49,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28223 conditions, 8881 events. 4873/8881 cut-off events. For 18395/18867 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 60213 event pairs, 1763 based on Foata normal form. 165/8618 useless extension candidates. Maximal degree in co-relation 28088. Up to 2688 conditions per place. [2025-02-08 14:14:49,531 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 218 selfloop transitions, 84 changer transitions 0/339 dead transitions. [2025-02-08 14:14:49,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 339 transitions, 2703 flow [2025-02-08 14:14:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 14:14:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 14:14:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1101 transitions. [2025-02-08 14:14:49,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349854227405247 [2025-02-08 14:14:49,534 INFO L175 Difference]: Start difference. First operand has 178 places, 159 transitions, 1161 flow. Second operand 21 states and 1101 transitions. [2025-02-08 14:14:49,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 339 transitions, 2703 flow [2025-02-08 14:14:49,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 339 transitions, 2669 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:14:49,565 INFO L231 Difference]: Finished difference. Result has 200 places, 189 transitions, 1629 flow [2025-02-08 14:14:49,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1629, PETRI_PLACES=200, PETRI_TRANSITIONS=189} [2025-02-08 14:14:49,566 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 106 predicate places. [2025-02-08 14:14:49,566 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 189 transitions, 1629 flow [2025-02-08 14:14:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 44.17391304347826) internal successors, (1016), 23 states have internal predecessors, (1016), 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:14:49,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:49,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:49,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 14:14:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:49,767 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:49,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -625420558, now seen corresponding path program 1 times [2025-02-08 14:14:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682972703] [2025-02-08 14:14:49,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:49,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:49,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:14:49,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:14:49,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:49,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682972703] [2025-02-08 14:14:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682972703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:14:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436435138] [2025-02-08 14:14:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:14:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:49,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:14:49,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:14:49,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:14:49,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 189 transitions, 1629 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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:14:49,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:49,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:14:49,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:51,302 INFO L124 PetriNetUnfolderBase]: 9245/15777 cut-off events. [2025-02-08 14:14:51,302 INFO L125 PetriNetUnfolderBase]: For 36347/37415 co-relation queries the response was YES. [2025-02-08 14:14:51,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53684 conditions, 15777 events. 9245/15777 cut-off events. For 36347/37415 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 112670 event pairs, 7704 based on Foata normal form. 291/15515 useless extension candidates. Maximal degree in co-relation 53535. Up to 6825 conditions per place. [2025-02-08 14:14:51,467 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 182 selfloop transitions, 21 changer transitions 0/236 dead transitions. [2025-02-08 14:14:51,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 236 transitions, 2326 flow [2025-02-08 14:14:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:14:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:14:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2025-02-08 14:14:51,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-02-08 14:14:51,468 INFO L175 Difference]: Start difference. First operand has 200 places, 189 transitions, 1629 flow. Second operand 5 states and 276 transitions. [2025-02-08 14:14:51,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 236 transitions, 2326 flow [2025-02-08 14:14:51,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 236 transitions, 2266 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-02-08 14:14:51,585 INFO L231 Difference]: Finished difference. Result has 203 places, 191 transitions, 1670 flow [2025-02-08 14:14:51,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1670, PETRI_PLACES=203, PETRI_TRANSITIONS=191} [2025-02-08 14:14:51,585 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 109 predicate places. [2025-02-08 14:14:51,585 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 191 transitions, 1670 flow [2025-02-08 14:14:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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:14:51,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:51,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:51,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 14:14:51,586 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2127444951, now seen corresponding path program 1 times [2025-02-08 14:14:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122491565] [2025-02-08 14:14:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:51,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:14:51,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:14:51,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:51,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:51,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:51,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122491565] [2025-02-08 14:14:51,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122491565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:51,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:14:51,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353491125] [2025-02-08 14:14:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:51,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 14:14:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:51,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:14:51,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:14:51,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 98 [2025-02-08 14:14:51,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 191 transitions, 1670 flow. Second operand has 7 states, 7 states have (on average 42.714285714285715) internal successors, (299), 7 states have internal predecessors, (299), 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:14:51,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:51,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 98 [2025-02-08 14:14:51,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:53,720 INFO L124 PetriNetUnfolderBase]: 12292/20920 cut-off events. [2025-02-08 14:14:53,720 INFO L125 PetriNetUnfolderBase]: For 42943/44377 co-relation queries the response was YES. [2025-02-08 14:14:53,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68070 conditions, 20920 events. 12292/20920 cut-off events. For 42943/44377 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 156867 event pairs, 6537 based on Foata normal form. 366/20480 useless extension candidates. Maximal degree in co-relation 67947. Up to 10422 conditions per place. [2025-02-08 14:14:53,916 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 174 selfloop transitions, 33 changer transitions 0/237 dead transitions. [2025-02-08 14:14:53,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 237 transitions, 2344 flow [2025-02-08 14:14:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:14:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:14:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 306 transitions. [2025-02-08 14:14:53,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2025-02-08 14:14:53,917 INFO L175 Difference]: Start difference. First operand has 203 places, 191 transitions, 1670 flow. Second operand 6 states and 306 transitions. [2025-02-08 14:14:53,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 237 transitions, 2344 flow [2025-02-08 14:14:54,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 237 transitions, 2338 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:14:54,051 INFO L231 Difference]: Finished difference. Result has 211 places, 201 transitions, 1866 flow [2025-02-08 14:14:54,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=211, PETRI_TRANSITIONS=201} [2025-02-08 14:14:54,052 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 117 predicate places. [2025-02-08 14:14:54,052 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 201 transitions, 1866 flow [2025-02-08 14:14:54,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.714285714285715) internal successors, (299), 7 states have internal predecessors, (299), 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:14:54,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:54,052 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 14:14:54,052 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash -957273965, now seen corresponding path program 1 times [2025-02-08 14:14:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411770225] [2025-02-08 14:14:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:54,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:14:54,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:14:54,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:54,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:14:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411770225] [2025-02-08 14:14:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411770225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:14:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886175736] [2025-02-08 14:14:54,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:54,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:54,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:14:54,156 INFO L229 MonitoredProcess]: Starting monitored process 18 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:14:54,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 14:14:54,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:14:54,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:14:54,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:54,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:54,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:14:54,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:14:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:14:54,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:14:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:14:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886175736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:14:54,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:14:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 14:14:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181210639] [2025-02-08 14:14:54,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:14:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 14:14:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:14:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:14:54,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2025-02-08 14:14:54,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 201 transitions, 1866 flow. Second operand has 15 states, 15 states have (on average 45.4) internal successors, (681), 15 states have internal predecessors, (681), 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:14:54,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:54,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2025-02-08 14:14:54,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:56,595 INFO L124 PetriNetUnfolderBase]: 11928/20439 cut-off events. [2025-02-08 14:14:56,595 INFO L125 PetriNetUnfolderBase]: For 44156/45412 co-relation queries the response was YES. [2025-02-08 14:14:56,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65888 conditions, 20439 events. 11928/20439 cut-off events. For 44156/45412 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 147955 event pairs, 7477 based on Foata normal form. 152/19254 useless extension candidates. Maximal degree in co-relation 65754. Up to 12639 conditions per place. [2025-02-08 14:14:56,788 INFO L140 encePairwiseOnDemand]: 85/98 looper letters, 153 selfloop transitions, 79 changer transitions 0/272 dead transitions. [2025-02-08 14:14:56,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 272 transitions, 2805 flow [2025-02-08 14:14:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:14:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 14:14:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 622 transitions. [2025-02-08 14:14:56,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289115646258503 [2025-02-08 14:14:56,790 INFO L175 Difference]: Start difference. First operand has 211 places, 201 transitions, 1866 flow. Second operand 12 states and 622 transitions. [2025-02-08 14:14:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 272 transitions, 2805 flow [2025-02-08 14:14:56,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 272 transitions, 2792 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:14:56,898 INFO L231 Difference]: Finished difference. Result has 224 places, 203 transitions, 2085 flow [2025-02-08 14:14:56,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2085, PETRI_PLACES=224, PETRI_TRANSITIONS=203} [2025-02-08 14:14:56,899 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 130 predicate places. [2025-02-08 14:14:56,899 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 203 transitions, 2085 flow [2025-02-08 14:14:56,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.4) internal successors, (681), 15 states have internal predecessors, (681), 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:14:56,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:14:56,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:14:56,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 14:14:57,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:14:57,100 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:14:57,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:14:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash 453885184, now seen corresponding path program 1 times [2025-02-08 14:14:57,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:14:57,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208705831] [2025-02-08 14:14:57,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:14:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:14:57,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:14:57,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:14:57,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:14:57,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:14:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:14:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:14:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208705831] [2025-02-08 14:14:57,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208705831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:14:57,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:14:57,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 14:14:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187883482] [2025-02-08 14:14:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:14:57,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 14:14:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:14:57,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 14:14:57,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 14:14:57,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 98 [2025-02-08 14:14:57,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 203 transitions, 2085 flow. Second operand has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 states have internal predecessors, (289), 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:14:57,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:14:57,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 98 [2025-02-08 14:14:57,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:14:59,894 INFO L124 PetriNetUnfolderBase]: 12404/22361 cut-off events. [2025-02-08 14:14:59,894 INFO L125 PetriNetUnfolderBase]: For 45339/46701 co-relation queries the response was YES. [2025-02-08 14:15:00,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73509 conditions, 22361 events. 12404/22361 cut-off events. For 45339/46701 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 177567 event pairs, 10254 based on Foata normal form. 236/21870 useless extension candidates. Maximal degree in co-relation 73359. Up to 12278 conditions per place. [2025-02-08 14:15:00,170 INFO L140 encePairwiseOnDemand]: 81/98 looper letters, 192 selfloop transitions, 48 changer transitions 5/264 dead transitions. [2025-02-08 14:15:00,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 264 transitions, 2936 flow [2025-02-08 14:15:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:15:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 14:15:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 496 transitions. [2025-02-08 14:15:00,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36151603498542273 [2025-02-08 14:15:00,172 INFO L175 Difference]: Start difference. First operand has 224 places, 203 transitions, 2085 flow. Second operand 14 states and 496 transitions. [2025-02-08 14:15:00,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 264 transitions, 2936 flow [2025-02-08 14:15:00,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 264 transitions, 2793 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:15:00,355 INFO L231 Difference]: Finished difference. Result has 235 places, 212 transitions, 2163 flow [2025-02-08 14:15:00,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2163, PETRI_PLACES=235, PETRI_TRANSITIONS=212} [2025-02-08 14:15:00,355 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 141 predicate places. [2025-02-08 14:15:00,355 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 212 transitions, 2163 flow [2025-02-08 14:15:00,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 states have internal predecessors, (289), 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:15:00,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:00,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:00,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 14:15:00,356 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:00,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 73648666, now seen corresponding path program 1 times [2025-02-08 14:15:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053825451] [2025-02-08 14:15:00,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:15:00,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:15:00,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:00,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:00,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053825451] [2025-02-08 14:15:00,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053825451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:00,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:00,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:15:00,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798749209] [2025-02-08 14:15:00,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:00,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:00,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:00,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:00,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:15:00,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 212 transitions, 2163 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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:15:00,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:00,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:15:00,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:03,026 INFO L124 PetriNetUnfolderBase]: 12399/22379 cut-off events. [2025-02-08 14:15:03,026 INFO L125 PetriNetUnfolderBase]: For 46531/47899 co-relation queries the response was YES. [2025-02-08 14:15:03,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73685 conditions, 22379 events. 12399/22379 cut-off events. For 46531/47899 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 177980 event pairs, 10254 based on Foata normal form. 235/21924 useless extension candidates. Maximal degree in co-relation 73536. Up to 11751 conditions per place. [2025-02-08 14:15:03,205 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 190 selfloop transitions, 25 changer transitions 0/260 dead transitions. [2025-02-08 14:15:03,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 260 transitions, 2880 flow [2025-02-08 14:15:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:15:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:15:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2025-02-08 14:15:03,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959183673469388 [2025-02-08 14:15:03,206 INFO L175 Difference]: Start difference. First operand has 235 places, 212 transitions, 2163 flow. Second operand 5 states and 292 transitions. [2025-02-08 14:15:03,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 260 transitions, 2880 flow [2025-02-08 14:15:03,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 260 transitions, 2857 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 14:15:03,522 INFO L231 Difference]: Finished difference. Result has 235 places, 212 transitions, 2205 flow [2025-02-08 14:15:03,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2205, PETRI_PLACES=235, PETRI_TRANSITIONS=212} [2025-02-08 14:15:03,523 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 141 predicate places. [2025-02-08 14:15:03,523 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 212 transitions, 2205 flow [2025-02-08 14:15:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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:15:03,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:03,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 14:15:03,524 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:03,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash -70107882, now seen corresponding path program 1 times [2025-02-08 14:15:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:03,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589192303] [2025-02-08 14:15:03,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:03,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 14:15:03,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 14:15:03,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:03,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:03,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589192303] [2025-02-08 14:15:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589192303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:03,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:03,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 14:15:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644634065] [2025-02-08 14:15:03,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 14:15:03,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:03,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:15:03,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:15:03,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 98 [2025-02-08 14:15:03,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 212 transitions, 2205 flow. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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:15:03,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:03,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 98 [2025-02-08 14:15:03,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:06,137 INFO L124 PetriNetUnfolderBase]: 12659/22745 cut-off events. [2025-02-08 14:15:06,137 INFO L125 PetriNetUnfolderBase]: For 49419/51112 co-relation queries the response was YES. [2025-02-08 14:15:06,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75261 conditions, 22745 events. 12659/22745 cut-off events. For 49419/51112 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 181327 event pairs, 6506 based on Foata normal form. 296/22571 useless extension candidates. Maximal degree in co-relation 75110. Up to 13109 conditions per place. [2025-02-08 14:15:06,389 INFO L140 encePairwiseOnDemand]: 81/98 looper letters, 192 selfloop transitions, 41 changer transitions 13/271 dead transitions. [2025-02-08 14:15:06,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 271 transitions, 3109 flow [2025-02-08 14:15:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 14:15:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 14:15:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 490 transitions. [2025-02-08 14:15:06,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2025-02-08 14:15:06,390 INFO L175 Difference]: Start difference. First operand has 235 places, 212 transitions, 2205 flow. Second operand 13 states and 490 transitions. [2025-02-08 14:15:06,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 271 transitions, 3109 flow [2025-02-08 14:15:06,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 271 transitions, 3105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:15:06,583 INFO L231 Difference]: Finished difference. Result has 254 places, 220 transitions, 2420 flow [2025-02-08 14:15:06,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2420, PETRI_PLACES=254, PETRI_TRANSITIONS=220} [2025-02-08 14:15:06,584 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 160 predicate places. [2025-02-08 14:15:06,584 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 220 transitions, 2420 flow [2025-02-08 14:15:06,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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:15:06,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:06,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 14:15:06,585 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:06,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash -490340129, now seen corresponding path program 1 times [2025-02-08 14:15:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:06,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691496] [2025-02-08 14:15:06,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:06,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 14:15:06,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 14:15:06,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:06,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691496] [2025-02-08 14:15:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:15:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074661686] [2025-02-08 14:15:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:06,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:06,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:06,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:15:06,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 220 transitions, 2420 flow. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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:15:06,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:06,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:15:06,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:09,451 INFO L124 PetriNetUnfolderBase]: 12708/22881 cut-off events. [2025-02-08 14:15:09,451 INFO L125 PetriNetUnfolderBase]: For 51050/52368 co-relation queries the response was YES. [2025-02-08 14:15:09,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76742 conditions, 22881 events. 12708/22881 cut-off events. For 51050/52368 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 182871 event pairs, 10433 based on Foata normal form. 214/22228 useless extension candidates. Maximal degree in co-relation 76626. Up to 15655 conditions per place. [2025-02-08 14:15:09,931 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 184 selfloop transitions, 25 changer transitions 0/256 dead transitions. [2025-02-08 14:15:09,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 256 transitions, 3041 flow [2025-02-08 14:15:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:15:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:15:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2025-02-08 14:15:09,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5530612244897959 [2025-02-08 14:15:09,932 INFO L175 Difference]: Start difference. First operand has 254 places, 220 transitions, 2420 flow. Second operand 5 states and 271 transitions. [2025-02-08 14:15:09,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 256 transitions, 3041 flow [2025-02-08 14:15:10,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 256 transitions, 3013 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-08 14:15:10,085 INFO L231 Difference]: Finished difference. Result has 253 places, 221 transitions, 2472 flow [2025-02-08 14:15:10,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2472, PETRI_PLACES=253, PETRI_TRANSITIONS=221} [2025-02-08 14:15:10,086 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 159 predicate places. [2025-02-08 14:15:10,086 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 221 transitions, 2472 flow [2025-02-08 14:15:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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:15:10,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:10,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 14:15:10,086 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1979327002, now seen corresponding path program 1 times [2025-02-08 14:15:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950807466] [2025-02-08 14:15:10,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:15:10,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:15:10,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:10,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950807466] [2025-02-08 14:15:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950807466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:10,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 14:15:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245164236] [2025-02-08 14:15:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 14:15:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:10,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:15:10,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:15:10,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 98 [2025-02-08 14:15:10,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 221 transitions, 2472 flow. Second operand has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 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:15:10,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:10,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 98 [2025-02-08 14:15:10,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:13,182 INFO L124 PetriNetUnfolderBase]: 12692/22836 cut-off events. [2025-02-08 14:15:13,182 INFO L125 PetriNetUnfolderBase]: For 52977/54385 co-relation queries the response was YES. [2025-02-08 14:15:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76766 conditions, 22836 events. 12692/22836 cut-off events. For 52977/54385 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 182585 event pairs, 10656 based on Foata normal form. 238/22268 useless extension candidates. Maximal degree in co-relation 76597. Up to 12279 conditions per place. [2025-02-08 14:15:13,424 INFO L140 encePairwiseOnDemand]: 86/98 looper letters, 186 selfloop transitions, 36 changer transitions 3/259 dead transitions. [2025-02-08 14:15:13,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 259 transitions, 3110 flow [2025-02-08 14:15:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:15:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:15:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-02-08 14:15:13,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4970845481049563 [2025-02-08 14:15:13,425 INFO L175 Difference]: Start difference. First operand has 253 places, 221 transitions, 2472 flow. Second operand 7 states and 341 transitions. [2025-02-08 14:15:13,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 259 transitions, 3110 flow [2025-02-08 14:15:13,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 3080 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-08 14:15:13,596 INFO L231 Difference]: Finished difference. Result has 254 places, 213 transitions, 2435 flow [2025-02-08 14:15:13,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2435, PETRI_PLACES=254, PETRI_TRANSITIONS=213} [2025-02-08 14:15:13,597 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 160 predicate places. [2025-02-08 14:15:13,597 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 213 transitions, 2435 flow [2025-02-08 14:15:13,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 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:15:13,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:13,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 14:15:13,597 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:13,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -678321166, now seen corresponding path program 1 times [2025-02-08 14:15:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957653924] [2025-02-08 14:15:13,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:13,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 14:15:13,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 14:15:13,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:13,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957653924] [2025-02-08 14:15:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957653924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:15:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847266424] [2025-02-08 14:15:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:13,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:13,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:15:13,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 213 transitions, 2435 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:15:13,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:13,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:15:13,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:16,582 INFO L124 PetriNetUnfolderBase]: 12698/22781 cut-off events. [2025-02-08 14:15:16,582 INFO L125 PetriNetUnfolderBase]: For 53532/54850 co-relation queries the response was YES. [2025-02-08 14:15:16,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76661 conditions, 22781 events. 12698/22781 cut-off events. For 53532/54850 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 181540 event pairs, 10433 based on Foata normal form. 214/22128 useless extension candidates. Maximal degree in co-relation 76491. Up to 15814 conditions per place. [2025-02-08 14:15:16,750 INFO L140 encePairwiseOnDemand]: 87/98 looper letters, 181 selfloop transitions, 29 changer transitions 0/246 dead transitions. [2025-02-08 14:15:16,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 246 transitions, 3039 flow [2025-02-08 14:15:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:15:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:15:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 326 transitions. [2025-02-08 14:15:16,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5544217687074829 [2025-02-08 14:15:16,751 INFO L175 Difference]: Start difference. First operand has 254 places, 213 transitions, 2435 flow. Second operand 6 states and 326 transitions. [2025-02-08 14:15:16,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 246 transitions, 3039 flow [2025-02-08 14:15:16,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 246 transitions, 2982 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 14:15:16,906 INFO L231 Difference]: Finished difference. Result has 257 places, 212 transitions, 2456 flow [2025-02-08 14:15:16,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2456, PETRI_PLACES=257, PETRI_TRANSITIONS=212} [2025-02-08 14:15:16,906 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 163 predicate places. [2025-02-08 14:15:16,906 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 212 transitions, 2456 flow [2025-02-08 14:15:16,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:15:16,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:16,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:16,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 14:15:16,907 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash -538167023, now seen corresponding path program 1 times [2025-02-08 14:15:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816443452] [2025-02-08 14:15:16,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:16,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 14:15:16,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 14:15:16,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:16,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816443452] [2025-02-08 14:15:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816443452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:17,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:17,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:15:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7604554] [2025-02-08 14:15:17,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:17,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:15:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:17,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:15:17,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:15:17,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 98 [2025-02-08 14:15:17,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 212 transitions, 2456 flow. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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:15:17,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:17,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 98 [2025-02-08 14:15:17,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:19,696 INFO L124 PetriNetUnfolderBase]: 12690/22769 cut-off events. [2025-02-08 14:15:19,696 INFO L125 PetriNetUnfolderBase]: For 55216/56622 co-relation queries the response was YES. [2025-02-08 14:15:19,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76840 conditions, 22769 events. 12690/22769 cut-off events. For 55216/56622 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 181565 event pairs, 10656 based on Foata normal form. 226/22152 useless extension candidates. Maximal degree in co-relation 76669. Up to 18377 conditions per place. [2025-02-08 14:15:19,921 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 144 selfloop transitions, 23 changer transitions 9/211 dead transitions. [2025-02-08 14:15:19,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 211 transitions, 2794 flow [2025-02-08 14:15:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:15:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:15:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2025-02-08 14:15:19,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2025-02-08 14:15:19,922 INFO L175 Difference]: Start difference. First operand has 257 places, 212 transitions, 2456 flow. Second operand 5 states and 265 transitions. [2025-02-08 14:15:19,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 211 transitions, 2794 flow [2025-02-08 14:15:20,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 211 transitions, 2690 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-02-08 14:15:20,105 INFO L231 Difference]: Finished difference. Result has 252 places, 202 transitions, 2315 flow [2025-02-08 14:15:20,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2315, PETRI_PLACES=252, PETRI_TRANSITIONS=202} [2025-02-08 14:15:20,105 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 158 predicate places. [2025-02-08 14:15:20,105 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 202 transitions, 2315 flow [2025-02-08 14:15:20,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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:15:20,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:20,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:20,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 14:15:20,106 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:20,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1368591475, now seen corresponding path program 1 times [2025-02-08 14:15:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:20,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196287837] [2025-02-08 14:15:20,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:15:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:20,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 14:15:20,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 14:15:20,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:15:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:15:20,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196287837] [2025-02-08 14:15:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196287837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:15:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:15:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:15:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648827070] [2025-02-08 14:15:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:15:20,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:15:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:20,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:15:20,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:15:20,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 98 [2025-02-08 14:15:20,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 202 transitions, 2315 flow. Second operand has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 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:15:20,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:20,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 98 [2025-02-08 14:15:20,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:22,667 INFO L124 PetriNetUnfolderBase]: 12566/22040 cut-off events. [2025-02-08 14:15:22,667 INFO L125 PetriNetUnfolderBase]: For 55114/56968 co-relation queries the response was YES. [2025-02-08 14:15:22,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74256 conditions, 22040 events. 12566/22040 cut-off events. For 55114/56968 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 170311 event pairs, 4431 based on Foata normal form. 311/21955 useless extension candidates. Maximal degree in co-relation 74143. Up to 10369 conditions per place. [2025-02-08 14:15:22,875 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 133 selfloop transitions, 20 changer transitions 32/223 dead transitions. [2025-02-08 14:15:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 223 transitions, 2780 flow [2025-02-08 14:15:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:15:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:15:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2025-02-08 14:15:22,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 14:15:22,876 INFO L175 Difference]: Start difference. First operand has 252 places, 202 transitions, 2315 flow. Second operand 5 states and 294 transitions. [2025-02-08 14:15:22,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 223 transitions, 2780 flow [2025-02-08 14:15:23,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 223 transitions, 2646 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-02-08 14:15:23,078 INFO L231 Difference]: Finished difference. Result has 240 places, 173 transitions, 1776 flow [2025-02-08 14:15:23,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1776, PETRI_PLACES=240, PETRI_TRANSITIONS=173} [2025-02-08 14:15:23,079 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 146 predicate places. [2025-02-08 14:15:23,079 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 173 transitions, 1776 flow [2025-02-08 14:15:23,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 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:15:23,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:15:23,079 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:15:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 14:15:23,079 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-02-08 14:15:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:15:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1478280836, now seen corresponding path program 2 times [2025-02-08 14:15:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:15:23,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465530165] [2025-02-08 14:15:23,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:15:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:15:23,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-08 14:15:23,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 14:15:23,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:15:23,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 14:15:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:15:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465530165] [2025-02-08 14:15:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465530165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:15:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819916834] [2025-02-08 14:15:23,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:15:23,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:15:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:15:23,122 INFO L229 MonitoredProcess]: Starting monitored process 19 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:15:23,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 14:15:23,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-08 14:15:23,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 14:15:23,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:15:23,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:15:23,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:15:23,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:15:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 14:15:23,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:15:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 14:15:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819916834] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:15:23,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:15:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:15:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832677868] [2025-02-08 14:15:23,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:15:23,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:15:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:15:23,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:15:23,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:15:23,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 98 [2025-02-08 14:15:23,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 173 transitions, 1776 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:15:23,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:15:23,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 98 [2025-02-08 14:15:23,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:15:25,588 INFO L124 PetriNetUnfolderBase]: 11345/19145 cut-off events. [2025-02-08 14:15:25,588 INFO L125 PetriNetUnfolderBase]: For 47140/48728 co-relation queries the response was YES. [2025-02-08 14:15:25,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64285 conditions, 19145 events. 11345/19145 cut-off events. For 47140/48728 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 145078 event pairs, 7131 based on Foata normal form. 255/18430 useless extension candidates. Maximal degree in co-relation 64212. Up to 12756 conditions per place.