./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.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-more-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:13:02,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:13:02,497 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:13:02,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:13:02,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:13:02,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:13:02,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:13:02,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:13:02,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:13:02,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:13:02,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:13:02,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:13:02,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:13:02,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:13:02,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:13:02,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:13:02,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:13:02,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:13:02,524 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2025-02-08 14:13:02,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:13:02,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:13:02,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:13:02,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:13:02,776 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:13:02,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-02-08 14:13:03,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e194eb313/62760e082a73417ebb0d2cd337e4a64c/FLAG82196e40f [2025-02-08 14:13:04,148 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:13:04,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-02-08 14:13:04,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e194eb313/62760e082a73417ebb0d2cd337e4a64c/FLAG82196e40f [2025-02-08 14:13:04,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e194eb313/62760e082a73417ebb0d2cd337e4a64c [2025-02-08 14:13:04,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:13:04,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:13:04,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:13:04,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:13:04,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:13:04,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1c817b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04, skipping insertion in model container [2025-02-08 14:13:04,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:13:04,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:13:04,631 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:13:04,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:13:04,667 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:13:04,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04 WrapperNode [2025-02-08 14:13:04,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:13:04,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:13:04,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:13:04,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:13:04,673 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:13:04" (1/1) ... [2025-02-08 14:13:04,681 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:13:04" (1/1) ... [2025-02-08 14:13:04,712 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 284 [2025-02-08 14:13:04,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:13:04,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:13:04,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:13:04,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:13:04,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,750 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 14:13:04,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:13:04,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:13:04,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:13:04,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:13:04,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (1/1) ... [2025-02-08 14:13:04,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:13:04,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:04,815 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:13:04,818 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:13:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:13:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:13:04,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:13:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:13:04,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:13:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:13:04,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:13:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:13:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:13:04,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:13:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:13:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:13:04,840 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:13:04,951 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:13:04,959 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:13:05,061 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~mem3#1; [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~ite4#1; [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: havoc #t~ret2#1; [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: havoc #t~mem1#1; [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: ~mts1~0 := #t~ite4#1; [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: assume ~mts1~0 + #t~mem3#1 <= 2147483647; [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: assume !(~mts1~0 + #t~mem3#1 <= 2147483647); [2025-02-08 14:13:05,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: #t~ite4#1 := ~mts1~0 + #t~mem3#1; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: assume ~mts1~0 + #t~mem3#1 >= -2147483648; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: assume !(~mts1~0 + #t~mem3#1 >= -2147483648); [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: SUMMARY for call #t~mem3#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~0#1, 4); srcloc: null [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: assume #t~ret2#1 < 0; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: assume !(#t~ret2#1 < 0); [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: #t~ite4#1 := 0; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-11: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-12: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-13: havoc plus_#t~short31#1, plus_#t~short32#1, plus_~a#1, plus_~b#1; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-14: #t~ret2#1 := plus_#res#1; [2025-02-08 14:13:05,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~post5#1; [2025-02-08 14:13:05,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume 1 + #t~post5#1 <= 2147483647; [2025-02-08 14:13:05,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume !(1 + #t~post5#1 <= 2147483647); [2025-02-08 14:13:05,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: ~i~0#1 := 1 + #t~post5#1; [2025-02-08 14:13:05,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: assume 1 + #t~post5#1 >= -2147483648; [2025-02-08 14:13:05,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: assume !(1 + #t~post5#1 >= -2147483648); [2025-02-08 14:13:05,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: #t~post5#1 := ~i~0#1; [2025-02-08 14:13:05,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~mem8#1; [2025-02-08 14:13:05,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: havoc #t~ite9#1; [2025-02-08 14:13:05,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: havoc #t~ret7#1; [2025-02-08 14:13:05,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: havoc #t~mem6#1; [2025-02-08 14:13:05,125 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: ~mts2~0 := #t~ite9#1; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: assume ~mts2~0 + #t~mem8#1 <= 2147483647; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: assume !(~mts2~0 + #t~mem8#1 <= 2147483647); [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: #t~ite9#1 := ~mts2~0 + #t~mem8#1; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: assume ~mts2~0 + #t~mem8#1 >= -2147483648; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: assume !(~mts2~0 + #t~mem8#1 >= -2147483648); [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: SUMMARY for call #t~mem8#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~1#1, 4); srcloc: null [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: assume #t~ret7#1 < 0; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: assume !(#t~ret7#1 < 0); [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: #t~ite9#1 := 0; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-13: havoc plus_#t~short31#1, plus_#t~short32#1, plus_~a#1, plus_~b#1; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: #t~ret7#1 := plus_#res#1; [2025-02-08 14:13:05,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: havoc #t~post10#1; [2025-02-08 14:13:05,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume 1 + #t~post10#1 <= 2147483647; [2025-02-08 14:13:05,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume !(1 + #t~post10#1 <= 2147483647); [2025-02-08 14:13:05,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: ~i~1#1 := 1 + #t~post10#1; [2025-02-08 14:13:05,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume 1 + #t~post10#1 >= -2147483648; [2025-02-08 14:13:05,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume !(1 + #t~post10#1 >= -2147483648); [2025-02-08 14:13:05,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: #t~post10#1 := ~i~1#1; [2025-02-08 14:13:05,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short32#1; [2025-02-08 14:13:05,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:13:05,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:13:05,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short32#1 then 1 else 0); [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: plus_#t~short32#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume plus_#t~short32#1; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume !plus_#t~short32#1; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-9: plus_#t~short32#1 := plus_~b#1 <= 0; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:13:05,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-2: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-1: havoc #t~post17#1; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-2: assume 1 + #t~post17#1 <= 2147483647; [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-2: assume !(1 + #t~post17#1 <= 2147483647); [2025-02-08 14:13:05,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-3: ~i~2#1 := 1 + #t~post17#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-4: assume 1 + #t~post17#1 >= -2147483648; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-4: assume !(1 + #t~post17#1 >= -2147483648); [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L63-5: #t~post17#1 := ~i~2#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~mem13#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~ite14#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: havoc #t~ret12#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: havoc #t~mem11#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: ~mts3~0 := #t~ite14#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: assume ~mts3~0 + #t~mem13#1 <= 2147483647; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: assume !(~mts3~0 + #t~mem13#1 <= 2147483647); [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: #t~ite14#1 := ~mts3~0 + #t~mem13#1; [2025-02-08 14:13:05,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: assume ~mts3~0 + #t~mem13#1 >= -2147483648; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: assume !(~mts3~0 + #t~mem13#1 >= -2147483648); [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: SUMMARY for call #t~mem13#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: assume #t~ret12#1 < 0; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: assume !(#t~ret12#1 < 0); [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: #t~ite14#1 := 0; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-12: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-13: havoc plus_#t~short31#1, plus_#t~short32#1, plus_~a#1, plus_~b#1; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-14: #t~ret12#1 := plus_#res#1; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~ret16#1; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~mem15#1; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: ~sum~0 := #t~ret16#1; [2025-02-08 14:13:05,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: havoc plus_#t~short31#1, plus_#t~short32#1, plus_~a#1, plus_~b#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: #t~ret16#1 := plus_#res#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: havoc plus_#t~short31#1, plus_#t~short32#1, plus_~a#1, plus_~b#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-8: havoc plus_#res#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum~0, #t~mem15#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-10: SUMMARY for call #t~mem15#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short31#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:13:05,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short31#1 then 1 else 0); [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: plus_#t~short31#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume plus_#t~short31#1; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume !plus_#t~short31#1; [2025-02-08 14:13:05,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-9: plus_#t~short31#1 := plus_~b#1 >= 0; [2025-02-08 14:13:05,292 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:13:05,293 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:13:05,457 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L111-4 is not an error location. [2025-02-08 14:13:05,458 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:13:05,458 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:13:05,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:13:05 BoogieIcfgContainer [2025-02-08 14:13:05,458 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:13:05,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:13:05,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:13:05,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:13:05,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:13:04" (1/3) ... [2025-02-08 14:13:05,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372dfd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:13:05, skipping insertion in model container [2025-02-08 14:13:05,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:13:04" (2/3) ... [2025-02-08 14:13:05,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372dfd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:13:05, skipping insertion in model container [2025-02-08 14:13:05,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:13:05" (3/3) ... [2025-02-08 14:13:05,466 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-02-08 14:13:05,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:13:05,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 77 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-02-08 14:13:05,479 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:13:05,540 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:13:05,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 82 transitions, 185 flow [2025-02-08 14:13:05,587 INFO L124 PetriNetUnfolderBase]: 6/79 cut-off events. [2025-02-08 14:13:05,589 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:13:05,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 79 events. 6/79 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 283 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-02-08 14:13:05,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 82 transitions, 185 flow [2025-02-08 14:13:05,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 170 flow [2025-02-08 14:13:05,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:13:05,606 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;@da91414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:13:05,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-02-08 14:13:05,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:13:05,609 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:13:05,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:13:05,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:05,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:13:05,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:05,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash 718768, now seen corresponding path program 1 times [2025-02-08 14:13:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973802584] [2025-02-08 14:13:05,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:05,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:13:05,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:13:05,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:05,776 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:13:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973802584] [2025-02-08 14:13:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973802584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:13:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749131491] [2025-02-08 14:13:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:05,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:13:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:05,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:13:05,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:13:05,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:05,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:13:05,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:05,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:05,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:06,466 INFO L124 PetriNetUnfolderBase]: 3759/5807 cut-off events. [2025-02-08 14:13:06,466 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2025-02-08 14:13:06,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11298 conditions, 5807 events. 3759/5807 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 37155 event pairs, 3101 based on Foata normal form. 1/4490 useless extension candidates. Maximal degree in co-relation 10718. Up to 5262 conditions per place. [2025-02-08 14:13:06,507 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 37 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-02-08 14:13:06,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 254 flow [2025-02-08 14:13:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:13:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:13:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-02-08 14:13:06,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6128048780487805 [2025-02-08 14:13:06,520 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 170 flow. Second operand 4 states and 201 transitions. [2025-02-08 14:13:06,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 254 flow [2025-02-08 14:13:06,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 77 transitions, 242 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:13:06,533 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 183 flow [2025-02-08 14:13:06,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-02-08 14:13:06,538 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-02-08 14:13:06,539 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 183 flow [2025-02-08 14:13:06,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:13:06,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:06,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:13:06,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:13:06,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:06,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:06,541 INFO L85 PathProgramCache]: Analyzing trace with hash -61365572, now seen corresponding path program 1 times [2025-02-08 14:13:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:06,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430094798] [2025-02-08 14:13:06,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:06,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:13:06,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:13:06,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:06,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:06,669 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:13:06,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430094798] [2025-02-08 14:13:06,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430094798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760369746] [2025-02-08 14:13:06,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:06,676 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:13:06,678 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:13:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:13:06,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:13:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:06,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:13:06,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:06,766 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:13:06,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:13:06,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760369746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:06,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:13:06,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:13:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205708604] [2025-02-08 14:13:06,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:06,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:13:06,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:06,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:13:06,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:13:06,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:06,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 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:13:06,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:06,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:06,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:07,274 INFO L124 PetriNetUnfolderBase]: 3759/5806 cut-off events. [2025-02-08 14:13:07,275 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:13:07,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11155 conditions, 5806 events. 3759/5806 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 37066 event pairs, 3101 based on Foata normal form. 1/4490 useless extension candidates. Maximal degree in co-relation 11128. Up to 5257 conditions per place. [2025-02-08 14:13:07,300 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 33 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2025-02-08 14:13:07,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 259 flow [2025-02-08 14:13:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:13:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:13:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2025-02-08 14:13:07,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589430894308943 [2025-02-08 14:13:07,302 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 183 flow. Second operand 6 states and 275 transitions. [2025-02-08 14:13:07,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 76 transitions, 259 flow [2025-02-08 14:13:07,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:13:07,303 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 190 flow [2025-02-08 14:13:07,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2025-02-08 14:13:07,304 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 0 predicate places. [2025-02-08 14:13:07,304 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 190 flow [2025-02-08 14:13:07,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 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:13:07,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:07,304 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:13:07,314 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:13:07,508 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:13:07,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1902332076, now seen corresponding path program 1 times [2025-02-08 14:13:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244164403] [2025-02-08 14:13:07,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:07,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:13:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:13:07,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:07,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:07,603 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:13:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244164403] [2025-02-08 14:13:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244164403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593472655] [2025-02-08 14:13:07,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:07,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:07,606 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:13:07,607 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:13:07,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:13:07,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:13:07,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:07,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:07,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:13:07,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:07,693 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:13:07,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:07,727 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:13:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593472655] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:07,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:13:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864056592] [2025-02-08 14:13:07,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:13:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:07,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:13:07,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:13:07,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:07,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 190 flow. Second operand has 12 states, 12 states have (on average 40.083333333333336) internal successors, (481), 12 states have internal predecessors, (481), 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:13:07,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:07,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:07,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:08,231 INFO L124 PetriNetUnfolderBase]: 3762/5818 cut-off events. [2025-02-08 14:13:08,232 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 14:13:08,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11199 conditions, 5818 events. 3762/5818 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 37225 event pairs, 3101 based on Foata normal form. 3/4502 useless extension candidates. Maximal degree in co-relation 11129. Up to 5264 conditions per place. [2025-02-08 14:13:08,266 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 36 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-02-08 14:13:08,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 342 flow [2025-02-08 14:13:08,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:13:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:13:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 442 transitions. [2025-02-08 14:13:08,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390243902439025 [2025-02-08 14:13:08,268 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 190 flow. Second operand 10 states and 442 transitions. [2025-02-08 14:13:08,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 342 flow [2025-02-08 14:13:08,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 85 transitions, 296 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 14:13:08,272 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 242 flow [2025-02-08 14:13:08,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=242, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-02-08 14:13:08,273 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 7 predicate places. [2025-02-08 14:13:08,273 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 242 flow [2025-02-08 14:13:08,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 40.083333333333336) internal successors, (481), 12 states have internal predecessors, (481), 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:13:08,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:08,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:08,284 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:13:08,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:08,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1787814225, now seen corresponding path program 1 times [2025-02-08 14:13:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486974383] [2025-02-08 14:13:08,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:08,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:13:08,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:13:08,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:08,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:08,553 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:13:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486974383] [2025-02-08 14:13:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486974383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:08,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:08,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:13:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412817303] [2025-02-08 14:13:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:08,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:13:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:08,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:13:08,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:13:08,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 82 [2025-02-08 14:13:08,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:13:08,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:08,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 82 [2025-02-08 14:13:08,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:09,297 INFO L124 PetriNetUnfolderBase]: 6964/11413 cut-off events. [2025-02-08 14:13:09,298 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-02-08 14:13:09,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21400 conditions, 11413 events. 6964/11413 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 86934 event pairs, 2763 based on Foata normal form. 328/8925 useless extension candidates. Maximal degree in co-relation 21366. Up to 4584 conditions per place. [2025-02-08 14:13:09,346 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 93 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-02-08 14:13:09,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 128 transitions, 526 flow [2025-02-08 14:13:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:13:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:13:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2025-02-08 14:13:09,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121 [2025-02-08 14:13:09,349 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 242 flow. Second operand 4 states and 228 transitions. [2025-02-08 14:13:09,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 128 transitions, 526 flow [2025-02-08 14:13:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 128 transitions, 515 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:13:09,351 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 257 flow [2025-02-08 14:13:09,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2025-02-08 14:13:09,351 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 10 predicate places. [2025-02-08 14:13:09,351 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 257 flow [2025-02-08 14:13:09,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:13:09,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:09,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:09,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:13:09,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash 412334570, now seen corresponding path program 1 times [2025-02-08 14:13:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382859775] [2025-02-08 14:13:09,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:09,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:13:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:13:09,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:09,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:09,429 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:13:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382859775] [2025-02-08 14:13:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382859775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:13:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225277763] [2025-02-08 14:13:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:09,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:13:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:09,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:13:09,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:13:09,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 82 [2025-02-08 14:13:09,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:13:09,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:09,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 82 [2025-02-08 14:13:09,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:09,902 INFO L124 PetriNetUnfolderBase]: 4798/8379 cut-off events. [2025-02-08 14:13:09,902 INFO L125 PetriNetUnfolderBase]: For 1347/1649 co-relation queries the response was YES. [2025-02-08 14:13:09,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16427 conditions, 8379 events. 4798/8379 cut-off events. For 1347/1649 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 64868 event pairs, 4185 based on Foata normal form. 154/6802 useless extension candidates. Maximal degree in co-relation 16398. Up to 6797 conditions per place. [2025-02-08 14:13:09,928 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 46 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-02-08 14:13:09,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 350 flow [2025-02-08 14:13:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:13:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:13:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-02-08 14:13:09,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-02-08 14:13:09,931 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 257 flow. Second operand 3 states and 162 transitions. [2025-02-08 14:13:09,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 350 flow [2025-02-08 14:13:09,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 85 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:13:09,937 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 258 flow [2025-02-08 14:13:09,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-02-08 14:13:09,939 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 12 predicate places. [2025-02-08 14:13:09,939 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 258 flow [2025-02-08 14:13:09,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:13:09,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:09,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:09,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:13:09,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -856418722, now seen corresponding path program 1 times [2025-02-08 14:13:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133881842] [2025-02-08 14:13:09,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:09,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:13:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:13:09,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:09,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:10,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:10,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133881842] [2025-02-08 14:13:10,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133881842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:10,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883040626] [2025-02-08 14:13:10,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:10,197 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:13:10,198 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:13:10,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:13:10,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:13:10,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:10,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:10,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 14:13:10,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:10,285 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:13:10,319 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:13:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:10,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:10,379 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 16 treesize of output 14 [2025-02-08 14:13:10,383 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:13:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:10,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883040626] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:10,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:13:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207262594] [2025-02-08 14:13:10,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:13:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:10,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:13:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:13:10,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 82 [2025-02-08 14:13:10,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 258 flow. Second operand has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 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:13:10,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:10,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 82 [2025-02-08 14:13:10,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:11,183 INFO L124 PetriNetUnfolderBase]: 5061/9847 cut-off events. [2025-02-08 14:13:11,183 INFO L125 PetriNetUnfolderBase]: For 1443/1451 co-relation queries the response was YES. [2025-02-08 14:13:11,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18873 conditions, 9847 events. 5061/9847 cut-off events. For 1443/1451 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 86673 event pairs, 541 based on Foata normal form. 8/7993 useless extension candidates. Maximal degree in co-relation 18850. Up to 5249 conditions per place. [2025-02-08 14:13:11,225 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 79 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2025-02-08 14:13:11,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 124 transitions, 518 flow [2025-02-08 14:13:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:13:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:13:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 384 transitions. [2025-02-08 14:13:11,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-02-08 14:13:11,229 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 258 flow. Second operand 8 states and 384 transitions. [2025-02-08 14:13:11,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 124 transitions, 518 flow [2025-02-08 14:13:11,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 124 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:13:11,249 INFO L231 Difference]: Finished difference. Result has 97 places, 84 transitions, 272 flow [2025-02-08 14:13:11,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=272, PETRI_PLACES=97, PETRI_TRANSITIONS=84} [2025-02-08 14:13:11,249 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 16 predicate places. [2025-02-08 14:13:11,249 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 272 flow [2025-02-08 14:13:11,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 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:13:11,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:11,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:11,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 14:13:11,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:11,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:11,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1044627620, now seen corresponding path program 1 times [2025-02-08 14:13:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16220490] [2025-02-08 14:13:11,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:11,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:13:11,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:13:11,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:11,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:11,487 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:13:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16220490] [2025-02-08 14:13:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16220490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:11,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:13:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783211000] [2025-02-08 14:13:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:11,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:13:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:11,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:13:11,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:13:11,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 82 [2025-02-08 14:13:11,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:13:11,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:11,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 82 [2025-02-08 14:13:11,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:12,335 INFO L124 PetriNetUnfolderBase]: 9016/15713 cut-off events. [2025-02-08 14:13:12,336 INFO L125 PetriNetUnfolderBase]: For 4105/4701 co-relation queries the response was YES. [2025-02-08 14:13:12,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31698 conditions, 15713 events. 9016/15713 cut-off events. For 4105/4701 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 133644 event pairs, 3747 based on Foata normal form. 748/12953 useless extension candidates. Maximal degree in co-relation 31665. Up to 5925 conditions per place. [2025-02-08 14:13:12,389 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 93 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2025-02-08 14:13:12,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 592 flow [2025-02-08 14:13:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:13:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:13:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-02-08 14:13:12,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6890243902439024 [2025-02-08 14:13:12,390 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 272 flow. Second operand 4 states and 226 transitions. [2025-02-08 14:13:12,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 592 flow [2025-02-08 14:13:12,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 127 transitions, 563 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:13:12,394 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 279 flow [2025-02-08 14:13:12,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2025-02-08 14:13:12,394 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 15 predicate places. [2025-02-08 14:13:12,394 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 279 flow [2025-02-08 14:13:12,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:13:12,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:12,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:12,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:13:12,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:12,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash -779206657, now seen corresponding path program 1 times [2025-02-08 14:13:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733488165] [2025-02-08 14:13:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:12,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:12,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:13:12,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:13:12,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:12,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733488165] [2025-02-08 14:13:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733488165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061915920] [2025-02-08 14:13:12,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:12,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:12,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:12,525 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:13:12,530 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:13:12,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:13:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:13:12,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:12,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:12,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 14:13:12,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:12,622 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:13:12,660 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:13:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:12,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:12,724 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 14 treesize of output 12 [2025-02-08 14:13:12,729 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 18 treesize of output 16 [2025-02-08 14:13:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061915920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:12,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:13:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813667881] [2025-02-08 14:13:12,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 14:13:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:12,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:13:12,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:13:12,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 82 [2025-02-08 14:13:12,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 279 flow. Second operand has 13 states, 13 states have (on average 37.53846153846154) internal successors, (488), 13 states have internal predecessors, (488), 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:13:12,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:12,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 82 [2025-02-08 14:13:12,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:13,602 INFO L124 PetriNetUnfolderBase]: 7496/13878 cut-off events. [2025-02-08 14:13:13,602 INFO L125 PetriNetUnfolderBase]: For 3511/3998 co-relation queries the response was YES. [2025-02-08 14:13:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28999 conditions, 13878 events. 7496/13878 cut-off events. For 3511/3998 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 123068 event pairs, 957 based on Foata normal form. 468/11952 useless extension candidates. Maximal degree in co-relation 28967. Up to 8410 conditions per place. [2025-02-08 14:13:13,695 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 84 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2025-02-08 14:13:13,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 126 transitions, 575 flow [2025-02-08 14:13:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:13:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:13:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 369 transitions. [2025-02-08 14:13:13,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-08 14:13:13,697 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 279 flow. Second operand 8 states and 369 transitions. [2025-02-08 14:13:13,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 126 transitions, 575 flow [2025-02-08 14:13:13,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 126 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:13:13,733 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 295 flow [2025-02-08 14:13:13,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=295, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2025-02-08 14:13:13,734 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 21 predicate places. [2025-02-08 14:13:13,734 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 295 flow [2025-02-08 14:13:13,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.53846153846154) internal successors, (488), 13 states have internal predecessors, (488), 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:13:13,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:13,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:13,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:13:13,935 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:13:13,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:13,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1938435354, now seen corresponding path program 1 times [2025-02-08 14:13:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62234369] [2025-02-08 14:13:13,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:13,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:13,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:13,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:13,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62234369] [2025-02-08 14:13:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62234369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273770184] [2025-02-08 14:13:14,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:14,321 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:13:14,322 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:13:14,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:14,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:14,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:14,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:14,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 14:13:14,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:14,413 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 23 treesize of output 1 [2025-02-08 14:13:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:14,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:14,744 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 18 treesize of output 16 [2025-02-08 14:13:14,748 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 16 [2025-02-08 14:13:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:14,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273770184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:14,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:14,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-02-08 14:13:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095651550] [2025-02-08 14:13:14,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:14,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 14:13:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:14,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 14:13:14,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-08 14:13:14,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:14,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 295 flow. Second operand has 18 states, 18 states have (on average 40.888888888888886) internal successors, (736), 18 states have internal predecessors, (736), 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:13:14,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:14,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:14,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:16,933 INFO L124 PetriNetUnfolderBase]: 16430/28119 cut-off events. [2025-02-08 14:13:16,933 INFO L125 PetriNetUnfolderBase]: For 12366/13871 co-relation queries the response was YES. [2025-02-08 14:13:16,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62278 conditions, 28119 events. 16430/28119 cut-off events. For 12366/13871 co-relation queries the response was YES. Maximal size of possible extension queue 1561. Compared 250173 event pairs, 5508 based on Foata normal form. 1365/25318 useless extension candidates. Maximal degree in co-relation 62241. Up to 5221 conditions per place. [2025-02-08 14:13:17,091 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 158 selfloop transitions, 19 changer transitions 0/211 dead transitions. [2025-02-08 14:13:17,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 211 transitions, 1075 flow [2025-02-08 14:13:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:13:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 14:13:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 632 transitions. [2025-02-08 14:13:17,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2025-02-08 14:13:17,094 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 295 flow. Second operand 12 states and 632 transitions. [2025-02-08 14:13:17,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 211 transitions, 1075 flow [2025-02-08 14:13:17,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 211 transitions, 1031 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:13:17,123 INFO L231 Difference]: Finished difference. Result has 110 places, 91 transitions, 359 flow [2025-02-08 14:13:17,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=359, PETRI_PLACES=110, PETRI_TRANSITIONS=91} [2025-02-08 14:13:17,124 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 29 predicate places. [2025-02-08 14:13:17,124 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 91 transitions, 359 flow [2025-02-08 14:13:17,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 40.888888888888886) internal successors, (736), 18 states have internal predecessors, (736), 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:13:17,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:17,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:17,131 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:13:17,325 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:13:17,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:17,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1614397120, now seen corresponding path program 1 times [2025-02-08 14:13:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:17,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806408760] [2025-02-08 14:13:17,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:17,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:17,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:17,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:17,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:17,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:17,392 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:13:17,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806408760] [2025-02-08 14:13:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806408760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:13:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161049197] [2025-02-08 14:13:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:13:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:17,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:13:17,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:13:17,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 82 [2025-02-08 14:13:17,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 91 transitions, 359 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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:13:17,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:17,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 82 [2025-02-08 14:13:17,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:19,642 INFO L124 PetriNetUnfolderBase]: 20513/36616 cut-off events. [2025-02-08 14:13:19,642 INFO L125 PetriNetUnfolderBase]: For 17603/18901 co-relation queries the response was YES. [2025-02-08 14:13:19,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87274 conditions, 36616 events. 20513/36616 cut-off events. For 17603/18901 co-relation queries the response was YES. Maximal size of possible extension queue 1980. Compared 354216 event pairs, 11421 based on Foata normal form. 1844/33407 useless extension candidates. Maximal degree in co-relation 87234. Up to 17366 conditions per place. [2025-02-08 14:13:19,851 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 114 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2025-02-08 14:13:19,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 148 transitions, 811 flow [2025-02-08 14:13:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:13:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:13:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 265 transitions. [2025-02-08 14:13:19,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-02-08 14:13:19,852 INFO L175 Difference]: Start difference. First operand has 110 places, 91 transitions, 359 flow. Second operand 5 states and 265 transitions. [2025-02-08 14:13:19,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 148 transitions, 811 flow [2025-02-08 14:13:19,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 148 transitions, 800 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:13:19,973 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 353 flow [2025-02-08 14:13:19,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2025-02-08 14:13:19,974 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 29 predicate places. [2025-02-08 14:13:19,974 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 353 flow [2025-02-08 14:13:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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:13:19,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:19,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:19,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:13:19,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:19,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1938435356, now seen corresponding path program 1 times [2025-02-08 14:13:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229730060] [2025-02-08 14:13:19,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:19,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:19,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:19,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:19,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:20,049 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:13:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229730060] [2025-02-08 14:13:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229730060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:13:20,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337867754] [2025-02-08 14:13:20,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:20,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:13:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:20,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:13:20,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:13:20,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 82 [2025-02-08 14:13:20,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:13:20,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:20,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 82 [2025-02-08 14:13:20,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:21,823 INFO L124 PetriNetUnfolderBase]: 11948/22041 cut-off events. [2025-02-08 14:13:21,823 INFO L125 PetriNetUnfolderBase]: For 11673/12684 co-relation queries the response was YES. [2025-02-08 14:13:21,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52453 conditions, 22041 events. 11948/22041 cut-off events. For 11673/12684 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 206801 event pairs, 10989 based on Foata normal form. 744/20474 useless extension candidates. Maximal degree in co-relation 52414. Up to 17243 conditions per place. [2025-02-08 14:13:21,994 INFO L140 encePairwiseOnDemand]: 79/82 looper letters, 51 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-02-08 14:13:21,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 86 transitions, 439 flow [2025-02-08 14:13:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:13:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:13:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-02-08 14:13:21,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-02-08 14:13:21,995 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 353 flow. Second operand 3 states and 159 transitions. [2025-02-08 14:13:21,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 86 transitions, 439 flow [2025-02-08 14:13:22,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 86 transitions, 432 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:13:22,038 INFO L231 Difference]: Finished difference. Result has 107 places, 86 transitions, 330 flow [2025-02-08 14:13:22,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=107, PETRI_TRANSITIONS=86} [2025-02-08 14:13:22,039 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 26 predicate places. [2025-02-08 14:13:22,039 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 86 transitions, 330 flow [2025-02-08 14:13:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:13:22,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:22,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:22,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:13:22,039 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:22,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1938435353, now seen corresponding path program 1 times [2025-02-08 14:13:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704159192] [2025-02-08 14:13:22,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:22,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:22,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:22,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:22,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704159192] [2025-02-08 14:13:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704159192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729820491] [2025-02-08 14:13:22,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:22,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:22,529 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:13:22,531 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:13:22,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:22,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:22,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:22,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:22,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 14:13:22,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:22,616 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 23 treesize of output 1 [2025-02-08 14:13:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:22,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:22,882 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 20 treesize of output 18 [2025-02-08 14:13:22,886 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 26 treesize of output 20 [2025-02-08 14:13:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729820491] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:22,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-02-08 14:13:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623763234] [2025-02-08 14:13:22,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:22,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 14:13:22,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:22,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 14:13:22,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-08 14:13:22,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:22,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 86 transitions, 330 flow. Second operand has 17 states, 17 states have (on average 40.94117647058823) internal successors, (696), 17 states have internal predecessors, (696), 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:13:22,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:22,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:22,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:24,467 INFO L124 PetriNetUnfolderBase]: 10458/19659 cut-off events. [2025-02-08 14:13:24,469 INFO L125 PetriNetUnfolderBase]: For 10035/10944 co-relation queries the response was YES. [2025-02-08 14:13:24,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45830 conditions, 19659 events. 10458/19659 cut-off events. For 10035/10944 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 182589 event pairs, 5448 based on Foata normal form. 668/19021 useless extension candidates. Maximal degree in co-relation 45809. Up to 4703 conditions per place. [2025-02-08 14:13:24,609 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 150 selfloop transitions, 17 changer transitions 2/202 dead transitions. [2025-02-08 14:13:24,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 202 transitions, 1037 flow [2025-02-08 14:13:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:13:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 14:13:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 623 transitions. [2025-02-08 14:13:24,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.633130081300813 [2025-02-08 14:13:24,611 INFO L175 Difference]: Start difference. First operand has 107 places, 86 transitions, 330 flow. Second operand 12 states and 623 transitions. [2025-02-08 14:13:24,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 202 transitions, 1037 flow [2025-02-08 14:13:24,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 202 transitions, 1036 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:13:24,662 INFO L231 Difference]: Finished difference. Result has 117 places, 85 transitions, 359 flow [2025-02-08 14:13:24,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=359, PETRI_PLACES=117, PETRI_TRANSITIONS=85} [2025-02-08 14:13:24,662 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 36 predicate places. [2025-02-08 14:13:24,663 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 85 transitions, 359 flow [2025-02-08 14:13:24,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 40.94117647058823) internal successors, (696), 17 states have internal predecessors, (696), 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:13:24,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:24,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:24,671 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:13:24,863 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,SelfDestructingSolverStorable11 [2025-02-08 14:13:24,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1976282866, now seen corresponding path program 1 times [2025-02-08 14:13:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229639283] [2025-02-08 14:13:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:24,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:24,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:24,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:24,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229639283] [2025-02-08 14:13:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229639283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933832458] [2025-02-08 14:13:24,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:24,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:24,988 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:13:24,990 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:13:25,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:13:25,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:13:25,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:25,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:25,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:13:25,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:25,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933832458] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:25,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:25,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-02-08 14:13:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213458627] [2025-02-08 14:13:25,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:25,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 14:13:25,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:25,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 14:13:25,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-08 14:13:25,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:25,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 85 transitions, 359 flow. Second operand has 16 states, 16 states have (on average 40.5) internal successors, (648), 16 states have internal predecessors, (648), 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:13:25,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:25,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:26,338 INFO L124 PetriNetUnfolderBase]: 8517/16175 cut-off events. [2025-02-08 14:13:26,338 INFO L125 PetriNetUnfolderBase]: For 11376/12063 co-relation queries the response was YES. [2025-02-08 14:13:26,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39063 conditions, 16175 events. 8517/16175 cut-off events. For 11376/12063 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 147323 event pairs, 7650 based on Foata normal form. 617/15684 useless extension candidates. Maximal degree in co-relation 39041. Up to 11494 conditions per place. [2025-02-08 14:13:26,455 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 67 selfloop transitions, 13 changer transitions 7/120 dead transitions. [2025-02-08 14:13:26,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 643 flow [2025-02-08 14:13:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:13:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:13:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 387 transitions. [2025-02-08 14:13:26,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5899390243902439 [2025-02-08 14:13:26,457 INFO L175 Difference]: Start difference. First operand has 117 places, 85 transitions, 359 flow. Second operand 8 states and 387 transitions. [2025-02-08 14:13:26,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 643 flow [2025-02-08 14:13:26,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 619 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 14:13:26,502 INFO L231 Difference]: Finished difference. Result has 118 places, 87 transitions, 377 flow [2025-02-08 14:13:26,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=377, PETRI_PLACES=118, PETRI_TRANSITIONS=87} [2025-02-08 14:13:26,503 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 37 predicate places. [2025-02-08 14:13:26,503 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 87 transitions, 377 flow [2025-02-08 14:13:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.5) internal successors, (648), 16 states have internal predecessors, (648), 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:13:26,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:26,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:26,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:13:26,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:26,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:26,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:26,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1493296126, now seen corresponding path program 1 times [2025-02-08 14:13:26,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:26,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953452933] [2025-02-08 14:13:26,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:26,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:26,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:13:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:13:26,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:26,765 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:13:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953452933] [2025-02-08 14:13:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953452933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:13:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9063390] [2025-02-08 14:13:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:13:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:26,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:13:26,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:13:26,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 82 [2025-02-08 14:13:26,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 87 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 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:13:26,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:26,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 82 [2025-02-08 14:13:26,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:28,631 INFO L124 PetriNetUnfolderBase]: 14530/24778 cut-off events. [2025-02-08 14:13:28,631 INFO L125 PetriNetUnfolderBase]: For 19812/20752 co-relation queries the response was YES. [2025-02-08 14:13:28,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64193 conditions, 24778 events. 14530/24778 cut-off events. For 19812/20752 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 214760 event pairs, 1924 based on Foata normal form. 484/24009 useless extension candidates. Maximal degree in co-relation 64168. Up to 8120 conditions per place. [2025-02-08 14:13:28,759 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 128 selfloop transitions, 7 changer transitions 0/164 dead transitions. [2025-02-08 14:13:28,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 164 transitions, 981 flow [2025-02-08 14:13:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:13:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:13:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 294 transitions. [2025-02-08 14:13:28,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2025-02-08 14:13:28,761 INFO L175 Difference]: Start difference. First operand has 118 places, 87 transitions, 377 flow. Second operand 6 states and 294 transitions. [2025-02-08 14:13:28,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 164 transitions, 981 flow [2025-02-08 14:13:28,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 164 transitions, 951 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:13:28,840 INFO L231 Difference]: Finished difference. Result has 118 places, 87 transitions, 365 flow [2025-02-08 14:13:28,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=118, PETRI_TRANSITIONS=87} [2025-02-08 14:13:28,841 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 37 predicate places. [2025-02-08 14:13:28,841 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 87 transitions, 365 flow [2025-02-08 14:13:28,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 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:13:28,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:28,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:13:28,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1871149991, now seen corresponding path program 1 times [2025-02-08 14:13:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602666304] [2025-02-08 14:13:28,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:28,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:13:28,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:13:28,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:28,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:28,882 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:13:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:28,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602666304] [2025-02-08 14:13:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602666304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:28,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:13:28,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114382715] [2025-02-08 14:13:28,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:28,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:13:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:28,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:13:28,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:13:28,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 82 [2025-02-08 14:13:28,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 87 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:13:28,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:28,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 82 [2025-02-08 14:13:28,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:30,927 INFO L124 PetriNetUnfolderBase]: 13086/23123 cut-off events. [2025-02-08 14:13:30,928 INFO L125 PetriNetUnfolderBase]: For 19744/20412 co-relation queries the response was YES. [2025-02-08 14:13:30,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61080 conditions, 23123 events. 13086/23123 cut-off events. For 19744/20412 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 203116 event pairs, 6529 based on Foata normal form. 688/22926 useless extension candidates. Maximal degree in co-relation 61054. Up to 10039 conditions per place. [2025-02-08 14:13:31,030 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 151 selfloop transitions, 7 changer transitions 3/190 dead transitions. [2025-02-08 14:13:31,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 190 transitions, 1131 flow [2025-02-08 14:13:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:13:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:13:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2025-02-08 14:13:31,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6382113821138211 [2025-02-08 14:13:31,032 INFO L175 Difference]: Start difference. First operand has 118 places, 87 transitions, 365 flow. Second operand 6 states and 314 transitions. [2025-02-08 14:13:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 190 transitions, 1131 flow [2025-02-08 14:13:31,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 190 transitions, 1114 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-02-08 14:13:31,148 INFO L231 Difference]: Finished difference. Result has 118 places, 89 transitions, 376 flow [2025-02-08 14:13:31,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=118, PETRI_TRANSITIONS=89} [2025-02-08 14:13:31,149 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 37 predicate places. [2025-02-08 14:13:31,149 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 89 transitions, 376 flow [2025-02-08 14:13:31,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:13:31,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:31,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:31,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:13:31,150 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:31,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1871148998, now seen corresponding path program 1 times [2025-02-08 14:13:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:31,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025794940] [2025-02-08 14:13:31,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:31,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:13:31,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:13:31,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:31,180 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:13:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025794940] [2025-02-08 14:13:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025794940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:31,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:13:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120415315] [2025-02-08 14:13:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:13:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:31,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:13:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:13:31,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 82 [2025-02-08 14:13:31,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 89 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:13:31,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:31,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 82 [2025-02-08 14:13:31,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:32,828 INFO L124 PetriNetUnfolderBase]: 13767/23393 cut-off events. [2025-02-08 14:13:32,828 INFO L125 PetriNetUnfolderBase]: For 23224/24221 co-relation queries the response was YES. [2025-02-08 14:13:32,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63860 conditions, 23393 events. 13767/23393 cut-off events. For 23224/24221 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 197464 event pairs, 5840 based on Foata normal form. 993/23523 useless extension candidates. Maximal degree in co-relation 63835. Up to 9127 conditions per place. [2025-02-08 14:13:32,964 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 104 selfloop transitions, 3 changer transitions 3/139 dead transitions. [2025-02-08 14:13:32,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 814 flow [2025-02-08 14:13:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:13:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:13:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-02-08 14:13:32,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676829268292683 [2025-02-08 14:13:32,965 INFO L175 Difference]: Start difference. First operand has 118 places, 89 transitions, 376 flow. Second operand 4 states and 222 transitions. [2025-02-08 14:13:32,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 814 flow [2025-02-08 14:13:33,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 805 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 14:13:33,044 INFO L231 Difference]: Finished difference. Result has 118 places, 89 transitions, 375 flow [2025-02-08 14:13:33,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=118, PETRI_TRANSITIONS=89} [2025-02-08 14:13:33,045 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 37 predicate places. [2025-02-08 14:13:33,045 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 89 transitions, 375 flow [2025-02-08 14:13:33,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:13:33,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:33,045 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:13:33,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 14:13:33,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:33,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:33,046 INFO L85 PathProgramCache]: Analyzing trace with hash -664053792, now seen corresponding path program 2 times [2025-02-08 14:13:33,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:33,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113993596] [2025-02-08 14:13:33,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:33,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:13:33,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:13:33,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:13:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:33,071 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:13:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113993596] [2025-02-08 14:13:33,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113993596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033095364] [2025-02-08 14:13:33,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:33,078 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:13:33,080 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:13:33,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:13:33,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:13:33,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:13:33,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:33,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:13:33,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:33,144 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:13:33,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:33,163 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:13:33,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033095364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:33,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:33,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:13:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258091042] [2025-02-08 14:13:33,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:33,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:13:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:33,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:13:33,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:13:33,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-02-08 14:13:33,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 89 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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:13:33,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:33,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-02-08 14:13:33,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:34,605 INFO L124 PetriNetUnfolderBase]: 9561/18235 cut-off events. [2025-02-08 14:13:34,606 INFO L125 PetriNetUnfolderBase]: For 15771/16753 co-relation queries the response was YES. [2025-02-08 14:13:34,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46520 conditions, 18235 events. 9561/18235 cut-off events. For 15771/16753 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 168521 event pairs, 9117 based on Foata normal form. 821/17803 useless extension candidates. Maximal degree in co-relation 46496. Up to 13968 conditions per place. [2025-02-08 14:13:34,707 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 40 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2025-02-08 14:13:34,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 88 transitions, 475 flow [2025-02-08 14:13:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:13:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:13:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-02-08 14:13:34,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823170731707317 [2025-02-08 14:13:34,709 INFO L175 Difference]: Start difference. First operand has 118 places, 89 transitions, 375 flow. Second operand 4 states and 191 transitions. [2025-02-08 14:13:34,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 88 transitions, 475 flow [2025-02-08 14:13:34,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 88 transitions, 462 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-08 14:13:34,746 INFO L231 Difference]: Finished difference. Result has 115 places, 88 transitions, 382 flow [2025-02-08 14:13:34,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=115, PETRI_TRANSITIONS=88} [2025-02-08 14:13:34,749 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 34 predicate places. [2025-02-08 14:13:34,751 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 88 transitions, 382 flow [2025-02-08 14:13:34,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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:13:34,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:34,751 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:34,757 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:13:34,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 14:13:34,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:34,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1094122238, now seen corresponding path program 2 times [2025-02-08 14:13:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:34,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38605640] [2025-02-08 14:13:34,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:34,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:13:34,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:13:34,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:34,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:35,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38605640] [2025-02-08 14:13:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38605640] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029778394] [2025-02-08 14:13:35,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:35,204 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:13:35,205 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:13:35,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:13:35,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:13:35,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:35,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 14:13:35,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:35,275 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:13:35,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:13:35,318 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 29 treesize of output 13 [2025-02-08 14:13:35,361 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:13:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:35,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:35,504 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 23 treesize of output 21 [2025-02-08 14:13:35,509 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 52 treesize of output 50 [2025-02-08 14:13:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029778394] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:35,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-08 14:13:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354203750] [2025-02-08 14:13:35,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:35,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:13:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:35,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:13:35,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:13:35,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 82 [2025-02-08 14:13:35,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 88 transitions, 382 flow. Second operand has 19 states, 19 states have (on average 37.526315789473685) internal successors, (713), 19 states have internal predecessors, (713), 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:13:35,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:35,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 82 [2025-02-08 14:13:35,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:37,211 INFO L124 PetriNetUnfolderBase]: 10029/20550 cut-off events. [2025-02-08 14:13:37,212 INFO L125 PetriNetUnfolderBase]: For 15046/15656 co-relation queries the response was YES. [2025-02-08 14:13:37,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49998 conditions, 20550 events. 10029/20550 cut-off events. For 15046/15656 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 205865 event pairs, 1450 based on Foata normal form. 610/19718 useless extension candidates. Maximal degree in co-relation 49976. Up to 10210 conditions per place. [2025-02-08 14:13:37,481 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 83 selfloop transitions, 20 changer transitions 0/134 dead transitions. [2025-02-08 14:13:37,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 134 transitions, 782 flow [2025-02-08 14:13:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:13:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 14:13:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 396 transitions. [2025-02-08 14:13:37,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-02-08 14:13:37,483 INFO L175 Difference]: Start difference. First operand has 115 places, 88 transitions, 382 flow. Second operand 9 states and 396 transitions. [2025-02-08 14:13:37,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 134 transitions, 782 flow [2025-02-08 14:13:37,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 134 transitions, 752 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:13:37,579 INFO L231 Difference]: Finished difference. Result has 119 places, 87 transitions, 390 flow [2025-02-08 14:13:37,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=390, PETRI_PLACES=119, PETRI_TRANSITIONS=87} [2025-02-08 14:13:37,580 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 38 predicate places. [2025-02-08 14:13:37,580 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 87 transitions, 390 flow [2025-02-08 14:13:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 37.526315789473685) internal successors, (713), 19 states have internal predecessors, (713), 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:13:37,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:37,580 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:13:37,586 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:13:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 14:13:37,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:37,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -508841444, now seen corresponding path program 1 times [2025-02-08 14:13:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70839661] [2025-02-08 14:13:37,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:37,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:13:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:13:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:37,822 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:13:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70839661] [2025-02-08 14:13:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70839661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:37,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:37,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:13:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907094506] [2025-02-08 14:13:37,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:13:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:37,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:13:37,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:13:37,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 82 [2025-02-08 14:13:37,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 87 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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:13:37,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:37,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 82 [2025-02-08 14:13:37,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:39,280 INFO L124 PetriNetUnfolderBase]: 11666/20863 cut-off events. [2025-02-08 14:13:39,281 INFO L125 PetriNetUnfolderBase]: For 23305/24162 co-relation queries the response was YES. [2025-02-08 14:13:39,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57441 conditions, 20863 events. 11666/20863 cut-off events. For 23305/24162 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 181814 event pairs, 7160 based on Foata normal form. 927/20779 useless extension candidates. Maximal degree in co-relation 57419. Up to 11012 conditions per place. [2025-02-08 14:13:39,607 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 96 selfloop transitions, 3 changer transitions 10/137 dead transitions. [2025-02-08 14:13:39,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 137 transitions, 846 flow [2025-02-08 14:13:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:13:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:13:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-02-08 14:13:39,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6798780487804879 [2025-02-08 14:13:39,609 INFO L175 Difference]: Start difference. First operand has 119 places, 87 transitions, 390 flow. Second operand 4 states and 223 transitions. [2025-02-08 14:13:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 137 transitions, 846 flow [2025-02-08 14:13:39,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 137 transitions, 787 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 14:13:39,641 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 332 flow [2025-02-08 14:13:39,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2025-02-08 14:13:39,642 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 33 predicate places. [2025-02-08 14:13:39,642 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 332 flow [2025-02-08 14:13:39,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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:13:39,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:39,643 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:39,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:13:39,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:39,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash -441979020, now seen corresponding path program 1 times [2025-02-08 14:13:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:39,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080695564] [2025-02-08 14:13:39,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:39,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:13:39,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:13:39,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:39,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080695564] [2025-02-08 14:13:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080695564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069686111] [2025-02-08 14:13:39,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:39,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:39,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:39,782 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:13:39,784 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:13:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:13:39,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:13:39,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:39,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:39,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 14:13:39,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:39,852 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:13:39,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 14:13:39,881 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 27 treesize of output 11 [2025-02-08 14:13:39,911 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:13:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:39,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:40,017 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 21 treesize of output 19 [2025-02-08 14:13:40,019 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 44 treesize of output 42 [2025-02-08 14:13:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:40,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069686111] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:40,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-08 14:13:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000857750] [2025-02-08 14:13:40,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:40,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:13:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:40,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:13:40,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:13:40,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 82 [2025-02-08 14:13:40,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 332 flow. Second operand has 19 states, 19 states have (on average 35.63157894736842) internal successors, (677), 19 states have internal predecessors, (677), 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:13:40,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:40,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 82 [2025-02-08 14:13:40,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:41,534 INFO L124 PetriNetUnfolderBase]: 10910/20573 cut-off events. [2025-02-08 14:13:41,534 INFO L125 PetriNetUnfolderBase]: For 17350/18010 co-relation queries the response was YES. [2025-02-08 14:13:41,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53871 conditions, 20573 events. 10910/20573 cut-off events. For 17350/18010 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 193845 event pairs, 1096 based on Foata normal form. 1006/20144 useless extension candidates. Maximal degree in co-relation 53851. Up to 12748 conditions per place. [2025-02-08 14:13:41,698 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 86 selfloop transitions, 17 changer transitions 0/130 dead transitions. [2025-02-08 14:13:41,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 130 transitions, 742 flow [2025-02-08 14:13:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:13:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 14:13:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 379 transitions. [2025-02-08 14:13:41,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.513550135501355 [2025-02-08 14:13:41,704 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 332 flow. Second operand 9 states and 379 transitions. [2025-02-08 14:13:41,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 130 transitions, 742 flow [2025-02-08 14:13:41,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 130 transitions, 718 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-02-08 14:13:41,854 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 350 flow [2025-02-08 14:13:41,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=350, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2025-02-08 14:13:41,854 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 32 predicate places. [2025-02-08 14:13:41,854 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 82 transitions, 350 flow [2025-02-08 14:13:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 35.63157894736842) internal successors, (677), 19 states have internal predecessors, (677), 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:13:41,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:41,855 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:41,860 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:13:42,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:42,058 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -816448000, now seen corresponding path program 1 times [2025-02-08 14:13:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85233531] [2025-02-08 14:13:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:42,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:13:42,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:13:42,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:42,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:13:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85233531] [2025-02-08 14:13:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85233531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:42,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:13:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88035150] [2025-02-08 14:13:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:42,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:13:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:42,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:13:42,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:13:42,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 82 [2025-02-08 14:13:42,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 82 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 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:13:42,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:42,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 82 [2025-02-08 14:13:42,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:43,417 INFO L124 PetriNetUnfolderBase]: 11314/20520 cut-off events. [2025-02-08 14:13:43,417 INFO L125 PetriNetUnfolderBase]: For 16491/17199 co-relation queries the response was YES. [2025-02-08 14:13:43,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53847 conditions, 20520 events. 11314/20520 cut-off events. For 16491/17199 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 186354 event pairs, 6466 based on Foata normal form. 1400/21110 useless extension candidates. Maximal degree in co-relation 53828. Up to 9662 conditions per place. [2025-02-08 14:13:43,541 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 102 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-02-08 14:13:43,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 131 transitions, 756 flow [2025-02-08 14:13:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:13:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:13:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2025-02-08 14:13:43,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6268292682926829 [2025-02-08 14:13:43,543 INFO L175 Difference]: Start difference. First operand has 113 places, 82 transitions, 350 flow. Second operand 5 states and 257 transitions. [2025-02-08 14:13:43,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 131 transitions, 756 flow [2025-02-08 14:13:43,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 721 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 14:13:43,603 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 320 flow [2025-02-08 14:13:43,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2025-02-08 14:13:43,603 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 29 predicate places. [2025-02-08 14:13:43,603 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 81 transitions, 320 flow [2025-02-08 14:13:43,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 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:13:43,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:43,604 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:43,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 14:13:43,604 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:43,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1513890202, now seen corresponding path program 2 times [2025-02-08 14:13:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:43,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624915854] [2025-02-08 14:13:43,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:43,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 14:13:43,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:13:43,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624915854] [2025-02-08 14:13:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624915854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529307253] [2025-02-08 14:13:44,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:44,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:44,122 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:13:44,124 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:13:44,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 14:13:44,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:13:44,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:44,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:44,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 14:13:44,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:44,215 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:13:44,255 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 27 treesize of output 11 [2025-02-08 14:13:44,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-02-08 14:13:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:44,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:44,971 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 34 treesize of output 32 [2025-02-08 14:13:44,975 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 490 treesize of output 466 [2025-02-08 14:13:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529307253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:45,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:45,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2025-02-08 14:13:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525138684] [2025-02-08 14:13:45,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:45,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 14:13:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:45,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 14:13:45,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-02-08 14:13:45,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 82 [2025-02-08 14:13:45,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 81 transitions, 320 flow. Second operand has 32 states, 32 states have (on average 39.5) internal successors, (1264), 32 states have internal predecessors, (1264), 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:13:45,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:45,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 82 [2025-02-08 14:13:45,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:48,501 INFO L124 PetriNetUnfolderBase]: 20386/34085 cut-off events. [2025-02-08 14:13:48,501 INFO L125 PetriNetUnfolderBase]: For 21658/23571 co-relation queries the response was YES. [2025-02-08 14:13:48,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92709 conditions, 34085 events. 20386/34085 cut-off events. For 21658/23571 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 289848 event pairs, 9084 based on Foata normal form. 2960/36268 useless extension candidates. Maximal degree in co-relation 92690. Up to 6551 conditions per place. [2025-02-08 14:13:48,788 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 270 selfloop transitions, 29 changer transitions 5/332 dead transitions. [2025-02-08 14:13:48,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 332 transitions, 1877 flow [2025-02-08 14:13:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:13:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 14:13:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1169 transitions. [2025-02-08 14:13:48,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5940040650406504 [2025-02-08 14:13:48,794 INFO L175 Difference]: Start difference. First operand has 110 places, 81 transitions, 320 flow. Second operand 24 states and 1169 transitions. [2025-02-08 14:13:48,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 332 transitions, 1877 flow [2025-02-08 14:13:48,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 332 transitions, 1834 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:13:48,937 INFO L231 Difference]: Finished difference. Result has 135 places, 96 transitions, 486 flow [2025-02-08 14:13:48,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=486, PETRI_PLACES=135, PETRI_TRANSITIONS=96} [2025-02-08 14:13:48,938 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 54 predicate places. [2025-02-08 14:13:48,938 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 96 transitions, 486 flow [2025-02-08 14:13:48,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 39.5) internal successors, (1264), 32 states have internal predecessors, (1264), 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:13:48,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:48,938 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:48,944 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:13:49,139 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,SelfDestructingSolverStorable21 [2025-02-08 14:13:49,139 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1513890201, now seen corresponding path program 2 times [2025-02-08 14:13:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883563172] [2025-02-08 14:13:49,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:49,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 14:13:49,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:13:49,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:49,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883563172] [2025-02-08 14:13:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883563172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663547281] [2025-02-08 14:13:50,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:50,034 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:13:50,036 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:13:50,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 14:13:50,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:13:50,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:50,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:50,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 14:13:50,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:50,132 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:13:50,216 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 29 treesize of output 13 [2025-02-08 14:13:50,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2025-02-08 14:13:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:50,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:51,213 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 36 treesize of output 34 [2025-02-08 14:13:51,217 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 554 treesize of output 530 [2025-02-08 14:13:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663547281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:51,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2025-02-08 14:13:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724847590] [2025-02-08 14:13:51,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:51,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 14:13:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:51,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 14:13:51,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-02-08 14:13:51,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 82 [2025-02-08 14:13:51,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 96 transitions, 486 flow. Second operand has 32 states, 32 states have (on average 39.5) internal successors, (1264), 32 states have internal predecessors, (1264), 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:13:51,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:51,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 82 [2025-02-08 14:13:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:13:55,684 INFO L124 PetriNetUnfolderBase]: 18704/31705 cut-off events. [2025-02-08 14:13:55,684 INFO L125 PetriNetUnfolderBase]: For 31920/33679 co-relation queries the response was YES. [2025-02-08 14:13:55,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92934 conditions, 31705 events. 18704/31705 cut-off events. For 31920/33679 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 269923 event pairs, 9075 based on Foata normal form. 2457/33385 useless extension candidates. Maximal degree in co-relation 92910. Up to 6551 conditions per place. [2025-02-08 14:13:55,981 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 257 selfloop transitions, 29 changer transitions 16/330 dead transitions. [2025-02-08 14:13:55,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 330 transitions, 1917 flow [2025-02-08 14:13:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:13:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 14:13:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1166 transitions. [2025-02-08 14:13:55,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592479674796748 [2025-02-08 14:13:55,987 INFO L175 Difference]: Start difference. First operand has 135 places, 96 transitions, 486 flow. Second operand 24 states and 1166 transitions. [2025-02-08 14:13:55,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 330 transitions, 1917 flow [2025-02-08 14:13:56,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 330 transitions, 1860 flow, removed 15 selfloop flow, removed 11 redundant places. [2025-02-08 14:13:56,230 INFO L231 Difference]: Finished difference. Result has 147 places, 95 transitions, 480 flow [2025-02-08 14:13:56,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=480, PETRI_PLACES=147, PETRI_TRANSITIONS=95} [2025-02-08 14:13:56,230 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 66 predicate places. [2025-02-08 14:13:56,230 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 95 transitions, 480 flow [2025-02-08 14:13:56,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 39.5) internal successors, (1264), 32 states have internal predecessors, (1264), 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:13:56,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:56,231 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:56,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 14:13:56,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:56,431 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 14:13:56,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash 459916503, now seen corresponding path program 1 times [2025-02-08 14:13:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:56,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584911501] [2025-02-08 14:13:56,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:13:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:56,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:13:56,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:13:56,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:13:56,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:13:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584911501] [2025-02-08 14:13:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584911501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:13:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:13:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:13:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270272830] [2025-02-08 14:13:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:13:56,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:13:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:56,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:13:56,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:13:56,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 82 [2025-02-08 14:13:56,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 95 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 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:13:56,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:56,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 82 [2025-02-08 14:13:56,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand