./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.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-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:12:05,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:12:05,483 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:12:05,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:12:05,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:12:05,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:12:05,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:12:05,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:12:05,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:12:05,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:12:05,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:12:05,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:12:05,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:12:05,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:12:05,515 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:12:05,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:12:05,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:12:05,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:12:05,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:12:05,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:12:05,517 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-02-08 14:12:05,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:12:05,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:12:05,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:12:05,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:12:05,812 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:12:05,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-08 14:12:06,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22a9c4fd8/35beac4faf1c4ef29c327edaefc6619c/FLAG7233f25ee [2025-02-08 14:12:07,212 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:12:07,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-08 14:12:07,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22a9c4fd8/35beac4faf1c4ef29c327edaefc6619c/FLAG7233f25ee [2025-02-08 14:12:07,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22a9c4fd8/35beac4faf1c4ef29c327edaefc6619c [2025-02-08 14:12:07,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:12:07,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:12:07,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:12:07,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:12:07,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:12:07,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e291d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07, skipping insertion in model container [2025-02-08 14:12:07,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:12:07,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:12:07,404 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:12:07,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:12:07,442 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:12:07,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07 WrapperNode [2025-02-08 14:12:07,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:12:07,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:12:07,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:12:07,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:12:07,449 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:12:07" (1/1) ... [2025-02-08 14:12:07,457 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:12:07" (1/1) ... [2025-02-08 14:12:07,487 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 345 [2025-02-08 14:12:07,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:12:07,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:12:07,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:12:07,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:12:07,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,520 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 2 writes are split as follows [0, 2]. [2025-02-08 14:12:07,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:12:07,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:12:07,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:12:07,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:12:07,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (1/1) ... [2025-02-08 14:12:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:12:07,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:07,575 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:12:07,577 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:12:07,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:12:07,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:12:07,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:12:07,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:12:07,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:12:07,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:12:07,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:12:07,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:12:07,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:12:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:12:07,601 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:12:07,703 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:12:07,705 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short30#1; [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:07,961 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~short30#1 then 1 else 0); [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:12:07,961 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: plus_#t~short30#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume plus_#t~short30#1; [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume !plus_#t~short30#1; [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-9: plus_#t~short30#1 := plus_~b#1 <= 0; [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:12:07,962 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-2: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~post5#1; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume 1 + #t~post5#1 <= 2147483647; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume !(1 + #t~post5#1 <= 2147483647); [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: ~i~0#1 := 1 + #t~post5#1; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: assume 1 + #t~post5#1 >= -2147483648; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: assume !(1 + #t~post5#1 >= -2147483648); [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: #t~post5#1 := ~i~0#1; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~ret4#1; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~ret3#1; [2025-02-08 14:12:07,965 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: havoc #t~mem2#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: havoc #t~mem1#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: ~res1~0 := #t~ret4#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: #t~ret4#1 := plus_#res#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: havoc plus_#res#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res1~0, #t~ret3#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-14: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-15: #t~ret3#1 := plus_#res#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short29#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:07,966 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~short29#1 then 1 else 0); [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: plus_#t~short29#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:12:07,966 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:12:07,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume plus_#t~short29#1; [2025-02-08 14:12:07,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume !plus_#t~short29#1; [2025-02-08 14:12:07,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-9: plus_#t~short29#1 := plus_~b#1 >= 0; [2025-02-08 14:12:07,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:12:07,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:12:07,967 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 14:12:08,062 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short30#1; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,063 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~short30#1 then 1 else 0); [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: plus_#t~short30#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:12:08,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume plus_#t~short30#1; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume !plus_#t~short30#1; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-9: plus_#t~short30#1 := plus_~b#1 <= 0; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-2: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: havoc #t~post10#1; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume 1 + #t~post10#1 <= 2147483647; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: assume !(1 + #t~post10#1 <= 2147483647); [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: ~i~1#1 := 1 + #t~post10#1; [2025-02-08 14:12:08,064 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume 1 + #t~post10#1 >= -2147483648; [2025-02-08 14:12:08,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume !(1 + #t~post10#1 >= -2147483648); [2025-02-08 14:12:08,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: #t~post10#1 := ~i~1#1; [2025-02-08 14:12:08,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: havoc ~tmp~0#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~ret9#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: havoc #t~ret8#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: havoc #t~mem7#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: havoc #t~mem6#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: ~tmp~0#1 := #t~ret9#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: #t~ret9#1 := plus_#res#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: havoc plus_#res#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret8#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:12:08,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-15: #t~ret8#1 := plus_#res#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57: [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: ~res2~0 := ~tmp~0#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short29#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,067 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~short29#1 then 1 else 0); [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:12:08,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: plus_#t~short29#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume plus_#t~short29#1; [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume !plus_#t~short29#1; [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-9: plus_#t~short29#1 := plus_~b#1 >= 0; [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:12:08,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 14:12:08,142 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short30#1; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,143 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~short30#1 then 1 else 0); [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-5: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-6: plus_#t~short30#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-7: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume plus_#t~short30#1; [2025-02-08 14:12:08,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-8: assume !plus_#t~short30#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-9: plus_#t~short30#1 := plus_~b#1 <= 0; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-1: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-2: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111-3: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~post15#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume 1 + #t~post15#1 <= 2147483647; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume !(1 + #t~post15#1 <= 2147483647); [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: ~i~2#1 := 1 + #t~post15#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: assume 1 + #t~post15#1 >= -2147483648; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: assume !(1 + #t~post15#1 >= -2147483648); [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: #t~post15#1 := ~i~2#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-6: havoc ~tmp~1#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret14#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~ret13#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: havoc #t~mem12#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: havoc #t~mem11#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: ~tmp~1#1 := #t~ret14#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: #t~ret14#1 := plus_#res#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: havoc plus_#res#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret13#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-14: havoc plus_#t~short29#1, plus_#t~short30#1, plus_~a#1, plus_~b#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-15: #t~ret13#1 := plus_#res#1; [2025-02-08 14:12:08,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: ~res2~0 := ~tmp~1#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short29#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,145 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~short29#1 then 1 else 0); [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: plus_#t~short29#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume plus_#t~short29#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume !plus_#t~short29#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-9: plus_#t~short29#1 := plus_~b#1 >= 0; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:12:08,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 14:12:08,241 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:12:08,242 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:12:08,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:12:08,372 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:12:08,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:12:08 BoogieIcfgContainer [2025-02-08 14:12:08,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:12:08,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:12:08,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:12:08,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:12:08,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:12:07" (1/3) ... [2025-02-08 14:12:08,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cd46bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:12:08, skipping insertion in model container [2025-02-08 14:12:08,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:12:07" (2/3) ... [2025-02-08 14:12:08,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cd46bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:12:08, skipping insertion in model container [2025-02-08 14:12:08,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:12:08" (3/3) ... [2025-02-08 14:12:08,380 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-02-08 14:12:08,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:12:08,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 82 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2025-02-08 14:12:08,393 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:12:08,445 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:12:08,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 199 flow [2025-02-08 14:12:08,500 INFO L124 PetriNetUnfolderBase]: 8/86 cut-off events. [2025-02-08 14:12:08,501 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:12:08,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 8/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 327 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-02-08 14:12:08,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 199 flow [2025-02-08 14:12:08,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 84 transitions, 183 flow [2025-02-08 14:12:08,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:12:08,523 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;@706884c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:12:08,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-02-08 14:12:08,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:12:08,527 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:12:08,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:12:08,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:08,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:12:08,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash 840118, now seen corresponding path program 1 times [2025-02-08 14:12:08,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882044480] [2025-02-08 14:12:08,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:08,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:12:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:12:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:08,774 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:12:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882044480] [2025-02-08 14:12:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882044480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:12:08,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916551948] [2025-02-08 14:12:08,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:08,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:08,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:08,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:08,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 89 [2025-02-08 14:12:08,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 89 [2025-02-08 14:12:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:09,488 INFO L124 PetriNetUnfolderBase]: 3670/7516 cut-off events. [2025-02-08 14:12:09,489 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-02-08 14:12:09,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12764 conditions, 7516 events. 3670/7516 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 64975 event pairs, 2736 based on Foata normal form. 2/5900 useless extension candidates. Maximal degree in co-relation 12121. Up to 5025 conditions per place. [2025-02-08 14:12:09,533 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 42 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2025-02-08 14:12:09,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 293 flow [2025-02-08 14:12:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 229 transitions. [2025-02-08 14:12:09,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6432584269662921 [2025-02-08 14:12:09,542 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 183 flow. Second operand 4 states and 229 transitions. [2025-02-08 14:12:09,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 293 flow [2025-02-08 14:12:09,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:12:09,556 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 234 flow [2025-02-08 14:12:09,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2025-02-08 14:12:09,563 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 1 predicate places. [2025-02-08 14:12:09,563 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 234 flow [2025-02-08 14:12:09,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:09,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:09,564 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:12:09,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:12:09,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:09,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash -741101537, now seen corresponding path program 1 times [2025-02-08 14:12:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550135232] [2025-02-08 14:12:09,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:09,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:12:09,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:12:09,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:09,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:09,683 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:12:09,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:09,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550135232] [2025-02-08 14:12:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550135232] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:09,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868190294] [2025-02-08 14:12:09,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:09,686 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:12:09,710 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:12:09,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:12:09,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:12:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:09,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:12:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:09,795 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:12:09,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:12:09,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868190294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:09,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:12:09,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:12:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138152516] [2025-02-08 14:12:09,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:09,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:12:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:09,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:12:09,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:12:09,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 89 [2025-02-08 14:12:09,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:09,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:09,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 89 [2025-02-08 14:12:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:10,364 INFO L124 PetriNetUnfolderBase]: 3670/7514 cut-off events. [2025-02-08 14:12:10,365 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-08 14:12:10,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12702 conditions, 7514 events. 3670/7514 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 64965 event pairs, 2736 based on Foata normal form. 2/5901 useless extension candidates. Maximal degree in co-relation 12652. Up to 5015 conditions per place. [2025-02-08 14:12:10,411 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 35 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2025-02-08 14:12:10,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 320 flow [2025-02-08 14:12:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:12:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:12:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 313 transitions. [2025-02-08 14:12:10,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5861423220973783 [2025-02-08 14:12:10,451 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 234 flow. Second operand 6 states and 313 transitions. [2025-02-08 14:12:10,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 320 flow [2025-02-08 14:12:10,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:12:10,453 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 250 flow [2025-02-08 14:12:10,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2025-02-08 14:12:10,454 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2025-02-08 14:12:10,454 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 250 flow [2025-02-08 14:12:10,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:10,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:10,454 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:12:10,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:12:10,659 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:12:10,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:10,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1499310418, now seen corresponding path program 1 times [2025-02-08 14:12:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239047402] [2025-02-08 14:12:10,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:12:10,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:12:10,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:10,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:10,773 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:12:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239047402] [2025-02-08 14:12:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239047402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408507027] [2025-02-08 14:12:10,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:10,775 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:12:10,779 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:12:10,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:12:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:12:10,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:10,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:10,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:12:10,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:10,853 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:12:10,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:10,886 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:12:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408507027] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:10,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:12:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007612367] [2025-02-08 14:12:10,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:10,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:12:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:10,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:12:10,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:12:10,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 89 [2025-02-08 14:12:10,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 250 flow. Second operand has 12 states, 12 states have (on average 45.083333333333336) internal successors, (541), 12 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:10,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:10,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 89 [2025-02-08 14:12:10,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:11,452 INFO L124 PetriNetUnfolderBase]: 3676/7538 cut-off events. [2025-02-08 14:12:11,452 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-02-08 14:12:11,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12796 conditions, 7538 events. 3676/7538 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 65190 event pairs, 2736 based on Foata normal form. 6/5928 useless extension candidates. Maximal degree in co-relation 12654. Up to 5026 conditions per place. [2025-02-08 14:12:11,487 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 40 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-02-08 14:12:11,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 106 transitions, 494 flow [2025-02-08 14:12:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:12:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:12:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 511 transitions. [2025-02-08 14:12:11,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5741573033707865 [2025-02-08 14:12:11,489 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 250 flow. Second operand 10 states and 511 transitions. [2025-02-08 14:12:11,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 106 transitions, 494 flow [2025-02-08 14:12:11,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 436 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-08 14:12:11,492 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 390 flow [2025-02-08 14:12:11,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-02-08 14:12:11,493 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 11 predicate places. [2025-02-08 14:12:11,493 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 390 flow [2025-02-08 14:12:11,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.083333333333336) internal successors, (541), 12 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:11,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:11,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:11,501 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:12:11,698 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:12:11,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:11,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2040513913, now seen corresponding path program 1 times [2025-02-08 14:12:11,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:11,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895400472] [2025-02-08 14:12:11,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:11,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:12:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:12:11,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:11,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:11,811 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:12:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895400472] [2025-02-08 14:12:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895400472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924879378] [2025-02-08 14:12:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:11,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:11,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:11,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 89 [2025-02-08 14:12:11,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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:12:11,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:11,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 89 [2025-02-08 14:12:11,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:12,590 INFO L124 PetriNetUnfolderBase]: 7634/13689 cut-off events. [2025-02-08 14:12:12,591 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-02-08 14:12:12,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24573 conditions, 13689 events. 7634/13689 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 114912 event pairs, 2685 based on Foata normal form. 364/11431 useless extension candidates. Maximal degree in co-relation 24506. Up to 4781 conditions per place. [2025-02-08 14:12:12,649 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 110 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-02-08 14:12:12,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 151 transitions, 714 flow [2025-02-08 14:12:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-02-08 14:12:12,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7331460674157303 [2025-02-08 14:12:12,652 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 390 flow. Second operand 4 states and 261 transitions. [2025-02-08 14:12:12,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 151 transitions, 714 flow [2025-02-08 14:12:12,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 151 transitions, 690 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-08 14:12:12,657 INFO L231 Difference]: Finished difference. Result has 100 places, 107 transitions, 392 flow [2025-02-08 14:12:12,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=100, PETRI_TRANSITIONS=107} [2025-02-08 14:12:12,658 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 14 predicate places. [2025-02-08 14:12:12,658 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 392 flow [2025-02-08 14:12:12,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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:12:12,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:12,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:12,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:12:12,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1168578954, now seen corresponding path program 1 times [2025-02-08 14:12:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272392285] [2025-02-08 14:12:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:12,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:12:12,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:12:12,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:12,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:12,778 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:12:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272392285] [2025-02-08 14:12:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272392285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328828660] [2025-02-08 14:12:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:12,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:12,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:12,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-02-08 14:12:12,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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:12:12,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:12,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-02-08 14:12:12,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:13,322 INFO L124 PetriNetUnfolderBase]: 4693/10044 cut-off events. [2025-02-08 14:12:13,322 INFO L125 PetriNetUnfolderBase]: For 1216/1488 co-relation queries the response was YES. [2025-02-08 14:12:13,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17716 conditions, 10044 events. 4693/10044 cut-off events. For 1216/1488 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 93625 event pairs, 3689 based on Foata normal form. 140/8192 useless extension candidates. Maximal degree in co-relation 17649. Up to 6492 conditions per place. [2025-02-08 14:12:13,363 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 55 selfloop transitions, 7 changer transitions 1/106 dead transitions. [2025-02-08 14:12:13,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 106 transitions, 513 flow [2025-02-08 14:12:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-08 14:12:13,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6713483146067416 [2025-02-08 14:12:13,364 INFO L175 Difference]: Start difference. First operand has 100 places, 107 transitions, 392 flow. Second operand 4 states and 239 transitions. [2025-02-08 14:12:13,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 106 transitions, 513 flow [2025-02-08 14:12:13,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:12:13,373 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 399 flow [2025-02-08 14:12:13,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2025-02-08 14:12:13,373 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 18 predicate places. [2025-02-08 14:12:13,373 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 399 flow [2025-02-08 14:12:13,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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:12:13,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:13,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:13,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:12:13,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:13,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash -204711846, now seen corresponding path program 1 times [2025-02-08 14:12:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590416054] [2025-02-08 14:12:13,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:13,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590416054] [2025-02-08 14:12:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590416054] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:13,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412960705] [2025-02-08 14:12:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:13,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:13,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:13,665 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:12:13,668 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:12:13,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:12:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:12:13,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:13,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:13,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 14:12:13,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:13,753 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:12:13,796 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:12:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:13,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:13,969 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:12:13,971 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:12:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412960705] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:13,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 14:12:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031467358] [2025-02-08 14:12:13,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 14:12:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:12:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:12:14,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-02-08 14:12:14,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 399 flow. Second operand has 15 states, 15 states have (on average 46.666666666666664) internal successors, (700), 15 states have internal predecessors, (700), 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:12:14,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:14,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-02-08 14:12:14,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:14,743 INFO L124 PetriNetUnfolderBase]: 5953/11397 cut-off events. [2025-02-08 14:12:14,743 INFO L125 PetriNetUnfolderBase]: For 1582/1610 co-relation queries the response was YES. [2025-02-08 14:12:14,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21733 conditions, 11397 events. 5953/11397 cut-off events. For 1582/1610 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 98173 event pairs, 761 based on Foata normal form. 28/10022 useless extension candidates. Maximal degree in co-relation 21663. Up to 6222 conditions per place. [2025-02-08 14:12:14,800 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 89 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2025-02-08 14:12:14,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 146 transitions, 697 flow [2025-02-08 14:12:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:12:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:12:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 447 transitions. [2025-02-08 14:12:14,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6278089887640449 [2025-02-08 14:12:14,802 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 399 flow. Second operand 8 states and 447 transitions. [2025-02-08 14:12:14,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 146 transitions, 697 flow [2025-02-08 14:12:14,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 146 transitions, 674 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 14:12:14,823 INFO L231 Difference]: Finished difference. Result has 105 places, 104 transitions, 406 flow [2025-02-08 14:12:14,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=406, PETRI_PLACES=105, PETRI_TRANSITIONS=104} [2025-02-08 14:12:14,823 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 19 predicate places. [2025-02-08 14:12:14,823 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 406 flow [2025-02-08 14:12:14,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 46.666666666666664) internal successors, (700), 15 states have internal predecessors, (700), 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:12:14,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:14,824 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:12:14,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:12:15,024 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:12:15,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:15,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2140712649, now seen corresponding path program 2 times [2025-02-08 14:12:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361899579] [2025-02-08 14:12:15,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:12:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:15,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:12:15,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:12:15,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:12:15,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:15,077 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:12:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361899579] [2025-02-08 14:12:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361899579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417011821] [2025-02-08 14:12:15,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:12:15,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:15,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:15,079 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:12:15,081 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:12:15,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:12:15,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:12:15,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:12:15,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:15,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:12:15,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:15,169 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:12:15,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:15,195 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:12:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417011821] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:15,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:12:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500311798] [2025-02-08 14:12:15,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:15,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:15,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:15,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:15,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 89 [2025-02-08 14:12:15,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 104 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:15,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:15,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 89 [2025-02-08 14:12:15,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:15,882 INFO L124 PetriNetUnfolderBase]: 4938/10330 cut-off events. [2025-02-08 14:12:15,882 INFO L125 PetriNetUnfolderBase]: For 1912/2178 co-relation queries the response was YES. [2025-02-08 14:12:15,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18872 conditions, 10330 events. 4938/10330 cut-off events. For 1912/2178 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 95345 event pairs, 3909 based on Foata normal form. 136/8489 useless extension candidates. Maximal degree in co-relation 18807. Up to 6840 conditions per place. [2025-02-08 14:12:15,942 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 48 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2025-02-08 14:12:15,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 522 flow [2025-02-08 14:12:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-02-08 14:12:15,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095505617977528 [2025-02-08 14:12:15,944 INFO L175 Difference]: Start difference. First operand has 105 places, 104 transitions, 406 flow. Second operand 4 states and 217 transitions. [2025-02-08 14:12:15,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 522 flow [2025-02-08 14:12:15,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 491 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:12:15,949 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 395 flow [2025-02-08 14:12:15,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=395, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2025-02-08 14:12:15,950 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2025-02-08 14:12:15,952 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 395 flow [2025-02-08 14:12:15,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:15,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:15,952 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:12:15,961 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:12:16,153 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,SelfDestructingSolverStorable6 [2025-02-08 14:12:16,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:16,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1930394341, now seen corresponding path program 1 times [2025-02-08 14:12:16,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:16,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318484529] [2025-02-08 14:12:16,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:16,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:16,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:12:16,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:12:16,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:16,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:12:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318484529] [2025-02-08 14:12:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318484529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423726954] [2025-02-08 14:12:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:16,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:16,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:16,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:16,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 89 [2025-02-08 14:12:16,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:12:16,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:16,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 89 [2025-02-08 14:12:16,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:17,184 INFO L124 PetriNetUnfolderBase]: 9929/18228 cut-off events. [2025-02-08 14:12:17,184 INFO L125 PetriNetUnfolderBase]: For 2631/3237 co-relation queries the response was YES. [2025-02-08 14:12:17,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34724 conditions, 18228 events. 9929/18228 cut-off events. For 2631/3237 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 162867 event pairs, 3597 based on Foata normal form. 802/15950 useless extension candidates. Maximal degree in co-relation 34657. Up to 6361 conditions per place. [2025-02-08 14:12:17,281 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 109 selfloop transitions, 4 changer transitions 0/148 dead transitions. [2025-02-08 14:12:17,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 148 transitions, 743 flow [2025-02-08 14:12:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-02-08 14:12:17,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7275280898876404 [2025-02-08 14:12:17,283 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 395 flow. Second operand 4 states and 259 transitions. [2025-02-08 14:12:17,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 148 transitions, 743 flow [2025-02-08 14:12:17,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 148 transitions, 713 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:12:17,287 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 391 flow [2025-02-08 14:12:17,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2025-02-08 14:12:17,287 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 17 predicate places. [2025-02-08 14:12:17,288 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 391 flow [2025-02-08 14:12:17,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:12:17,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:17,288 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:12:17,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:12:17,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:17,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2051129861, now seen corresponding path program 1 times [2025-02-08 14:12:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:17,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601988124] [2025-02-08 14:12:17,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:17,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:12:17,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:12:17,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:17,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:17,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601988124] [2025-02-08 14:12:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601988124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:17,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737654338] [2025-02-08 14:12:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:17,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:17,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:17,517 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:12:17,519 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:12:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:12:17,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:12:17,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:17,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:17,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:12:17,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:17,609 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:12:17,661 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:12:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:17,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:17,728 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:12:17,730 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:12:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737654338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:17,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:17,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 14:12:17,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475238843] [2025-02-08 14:12:17,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:17,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 14:12:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:17,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:12:17,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:12:17,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-02-08 14:12:17,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 391 flow. Second operand has 15 states, 15 states have (on average 44.8) internal successors, (672), 15 states have internal predecessors, (672), 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:12:17,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:17,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-02-08 14:12:17,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:18,688 INFO L124 PetriNetUnfolderBase]: 8939/16328 cut-off events. [2025-02-08 14:12:18,689 INFO L125 PetriNetUnfolderBase]: For 4286/4828 co-relation queries the response was YES. [2025-02-08 14:12:18,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33722 conditions, 16328 events. 8939/16328 cut-off events. For 4286/4828 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 141580 event pairs, 1051 based on Foata normal form. 540/15232 useless extension candidates. Maximal degree in co-relation 33658. Up to 9973 conditions per place. [2025-02-08 14:12:18,771 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 94 selfloop transitions, 16 changer transitions 0/147 dead transitions. [2025-02-08 14:12:18,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 147 transitions, 725 flow [2025-02-08 14:12:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:12:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:12:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 432 transitions. [2025-02-08 14:12:18,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6067415730337079 [2025-02-08 14:12:18,773 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 391 flow. Second operand 8 states and 432 transitions. [2025-02-08 14:12:18,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 147 transitions, 725 flow [2025-02-08 14:12:18,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 147 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:12:18,810 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 419 flow [2025-02-08 14:12:18,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=419, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2025-02-08 14:12:18,811 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 23 predicate places. [2025-02-08 14:12:18,811 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 419 flow [2025-02-08 14:12:18,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 44.8) internal successors, (672), 15 states have internal predecessors, (672), 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:12:18,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:18,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:18,818 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:12:19,015 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:12:19,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:19,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 839483580, now seen corresponding path program 1 times [2025-02-08 14:12:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829046657] [2025-02-08 14:12:19,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:19,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:12:19,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:12:19,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829046657] [2025-02-08 14:12:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829046657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181807884] [2025-02-08 14:12:19,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:19,260 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:12:19,261 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:12:19,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:12:19,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:12:19,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:19,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:19,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 14:12:19,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:19,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:12:19,335 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:12:19,362 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:12:19,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:12:19,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:12:19,424 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:12:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:19,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:19,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_123 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_123) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-02-08 14:12:19,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:19,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 14:12:19,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:19,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-02-08 14:12:19,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-08 14:12:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 14:12:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181807884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:19,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:19,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 14:12:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465633478] [2025-02-08 14:12:19,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:19,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 14:12:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:19,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 14:12:19,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 14:12:19,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-02-08 14:12:19,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 419 flow. Second operand has 20 states, 20 states have (on average 38.75) internal successors, (775), 20 states have internal predecessors, (775), 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:12:19,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:19,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-02-08 14:12:19,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:21,575 INFO L124 PetriNetUnfolderBase]: 12922/20841 cut-off events. [2025-02-08 14:12:21,575 INFO L125 PetriNetUnfolderBase]: For 5916/6688 co-relation queries the response was YES. [2025-02-08 14:12:21,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45150 conditions, 20841 events. 12922/20841 cut-off events. For 5916/6688 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 164144 event pairs, 1299 based on Foata normal form. 650/19351 useless extension candidates. Maximal degree in co-relation 45083. Up to 5992 conditions per place. [2025-02-08 14:12:21,651 INFO L140 encePairwiseOnDemand]: 74/89 looper letters, 187 selfloop transitions, 20 changer transitions 0/238 dead transitions. [2025-02-08 14:12:21,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 238 transitions, 1189 flow [2025-02-08 14:12:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 14:12:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 14:12:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 740 transitions. [2025-02-08 14:12:21,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5543071161048689 [2025-02-08 14:12:21,654 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 419 flow. Second operand 15 states and 740 transitions. [2025-02-08 14:12:21,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 238 transitions, 1189 flow [2025-02-08 14:12:21,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 238 transitions, 1156 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:12:21,669 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 418 flow [2025-02-08 14:12:21,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=418, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2025-02-08 14:12:21,670 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 29 predicate places. [2025-02-08 14:12:21,671 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 418 flow [2025-02-08 14:12:21,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.75) internal successors, (775), 20 states have internal predecessors, (775), 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:12:21,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:21,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:21,677 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:12:21,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 14:12:21,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:21,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -287316735, now seen corresponding path program 1 times [2025-02-08 14:12:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258194315] [2025-02-08 14:12:21,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:21,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:12:21,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:12:21,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:21,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258194315] [2025-02-08 14:12:21,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258194315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090414906] [2025-02-08 14:12:21,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:21,983 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:12:21,986 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:12:22,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:12:22,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:12:22,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:22,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:12:22,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:22,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090414906] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-08 14:12:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753640071] [2025-02-08 14:12:22,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:22,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 14:12:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:22,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 14:12:22,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-08 14:12:22,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 89 [2025-02-08 14:12:22,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 418 flow. Second operand has 17 states, 17 states have (on average 45.64705882352941) internal successors, (776), 17 states have internal predecessors, (776), 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:12:22,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:22,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 89 [2025-02-08 14:12:22,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:23,297 INFO L124 PetriNetUnfolderBase]: 7916/16890 cut-off events. [2025-02-08 14:12:23,297 INFO L125 PetriNetUnfolderBase]: For 6222/6501 co-relation queries the response was YES. [2025-02-08 14:12:23,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33542 conditions, 16890 events. 7916/16890 cut-off events. For 6222/6501 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 165746 event pairs, 6074 based on Foata normal form. 381/14772 useless extension candidates. Maximal degree in co-relation 33451. Up to 8962 conditions per place. [2025-02-08 14:12:23,385 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 86 selfloop transitions, 40 changer transitions 0/163 dead transitions. [2025-02-08 14:12:23,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 163 transitions, 922 flow [2025-02-08 14:12:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:12:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 14:12:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 631 transitions. [2025-02-08 14:12:23,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5908239700374532 [2025-02-08 14:12:23,387 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 418 flow. Second operand 12 states and 631 transitions. [2025-02-08 14:12:23,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 163 transitions, 922 flow [2025-02-08 14:12:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 163 transitions, 847 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-02-08 14:12:23,401 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 604 flow [2025-02-08 14:12:23,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=604, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2025-02-08 14:12:23,401 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 35 predicate places. [2025-02-08 14:12:23,401 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 604 flow [2025-02-08 14:12:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 45.64705882352941) internal successors, (776), 17 states have internal predecessors, (776), 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:12:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:23,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:23,408 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:12:23,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:23,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:23,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1477225954, now seen corresponding path program 1 times [2025-02-08 14:12:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600959935] [2025-02-08 14:12:23,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:23,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:12:23,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:12:23,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:23,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:12:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600959935] [2025-02-08 14:12:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600959935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:23,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:23,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:23,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639135441] [2025-02-08 14:12:23,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:23,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:23,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:23,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:23,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:23,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 89 [2025-02-08 14:12:23,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 604 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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:12:23,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:23,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 89 [2025-02-08 14:12:23,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:25,500 INFO L124 PetriNetUnfolderBase]: 15984/29797 cut-off events. [2025-02-08 14:12:25,501 INFO L125 PetriNetUnfolderBase]: For 8906/9256 co-relation queries the response was YES. [2025-02-08 14:12:25,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62806 conditions, 29797 events. 15984/29797 cut-off events. For 8906/9256 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 281643 event pairs, 6560 based on Foata normal form. 954/26713 useless extension candidates. Maximal degree in co-relation 62713. Up to 10403 conditions per place. [2025-02-08 14:12:25,733 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 130 selfloop transitions, 4 changer transitions 0/166 dead transitions. [2025-02-08 14:12:25,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 166 transitions, 1042 flow [2025-02-08 14:12:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-02-08 14:12:25,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7219101123595506 [2025-02-08 14:12:25,735 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 604 flow. Second operand 4 states and 257 transitions. [2025-02-08 14:12:25,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 166 transitions, 1042 flow [2025-02-08 14:12:25,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 166 transitions, 1016 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:12:25,823 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 604 flow [2025-02-08 14:12:25,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=604, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2025-02-08 14:12:25,823 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 39 predicate places. [2025-02-08 14:12:25,823 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 604 flow [2025-02-08 14:12:25,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 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:12:25,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:25,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:12:25,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:25,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 254188030, now seen corresponding path program 1 times [2025-02-08 14:12:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:25,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130066610] [2025-02-08 14:12:25,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:25,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:12:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:12:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:25,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130066610] [2025-02-08 14:12:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130066610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307809086] [2025-02-08 14:12:26,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:26,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:26,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:26,053 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:12:26,055 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:12:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:12:26,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:12:26,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:26,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:26,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 14:12:26,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:26,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:12:26,134 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:12:26,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:12:26,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:12:26,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:12:26,199 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:12:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:26,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:26,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_166) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-02-08 14:12:26,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:26,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-08 14:12:26,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:26,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 14:12:26,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-08 14:12:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 14:12:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307809086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:26,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-08 14:12:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526912915] [2025-02-08 14:12:26,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:26,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 14:12:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:26,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 14:12:26,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2025-02-08 14:12:26,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 89 [2025-02-08 14:12:26,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 604 flow. Second operand has 21 states, 21 states have (on average 38.76190476190476) internal successors, (814), 21 states have internal predecessors, (814), 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:12:26,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:26,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 89 [2025-02-08 14:12:26,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:28,844 INFO L124 PetriNetUnfolderBase]: 23301/36063 cut-off events. [2025-02-08 14:12:28,844 INFO L125 PetriNetUnfolderBase]: For 19088/21693 co-relation queries the response was YES. [2025-02-08 14:12:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86885 conditions, 36063 events. 23301/36063 cut-off events. For 19088/21693 co-relation queries the response was YES. Maximal size of possible extension queue 1504. Compared 286622 event pairs, 1428 based on Foata normal form. 1341/35678 useless extension candidates. Maximal degree in co-relation 86794. Up to 7992 conditions per place. [2025-02-08 14:12:29,060 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 235 selfloop transitions, 29 changer transitions 0/295 dead transitions. [2025-02-08 14:12:29,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 295 transitions, 1773 flow [2025-02-08 14:12:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 14:12:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 14:12:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 793 transitions. [2025-02-08 14:12:29,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5568820224719101 [2025-02-08 14:12:29,062 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 604 flow. Second operand 16 states and 793 transitions. [2025-02-08 14:12:29,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 295 transitions, 1773 flow [2025-02-08 14:12:29,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 295 transitions, 1773 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:12:29,122 INFO L231 Difference]: Finished difference. Result has 139 places, 118 transitions, 662 flow [2025-02-08 14:12:29,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=662, PETRI_PLACES=139, PETRI_TRANSITIONS=118} [2025-02-08 14:12:29,123 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 53 predicate places. [2025-02-08 14:12:29,123 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 118 transitions, 662 flow [2025-02-08 14:12:29,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.76190476190476) internal successors, (814), 21 states have internal predecessors, (814), 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:12:29,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:29,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:29,132 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:12:29,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:29,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:29,329 INFO L85 PathProgramCache]: Analyzing trace with hash 208584099, now seen corresponding path program 1 times [2025-02-08 14:12:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:29,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114958770] [2025-02-08 14:12:29,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:29,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:29,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:12:29,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:12:29,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:29,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:12:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114958770] [2025-02-08 14:12:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114958770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:12:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131858666] [2025-02-08 14:12:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:29,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:29,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:29,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:29,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 89 [2025-02-08 14:12:29,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 118 transitions, 662 flow. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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:12:29,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:29,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 89 [2025-02-08 14:12:29,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:31,507 INFO L124 PetriNetUnfolderBase]: 17430/32263 cut-off events. [2025-02-08 14:12:31,508 INFO L125 PetriNetUnfolderBase]: For 16479/17799 co-relation queries the response was YES. [2025-02-08 14:12:31,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76200 conditions, 32263 events. 17430/32263 cut-off events. For 16479/17799 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 304224 event pairs, 8248 based on Foata normal form. 1118/31108 useless extension candidates. Maximal degree in co-relation 76105. Up to 12679 conditions per place. [2025-02-08 14:12:31,828 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 181 selfloop transitions, 7 changer transitions 0/220 dead transitions. [2025-02-08 14:12:31,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 220 transitions, 1406 flow [2025-02-08 14:12:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:12:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:12:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 373 transitions. [2025-02-08 14:12:31,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6985018726591761 [2025-02-08 14:12:31,830 INFO L175 Difference]: Start difference. First operand has 139 places, 118 transitions, 662 flow. Second operand 6 states and 373 transitions. [2025-02-08 14:12:31,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 220 transitions, 1406 flow [2025-02-08 14:12:31,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 220 transitions, 1344 flow, removed 1 selfloop flow, removed 14 redundant places. [2025-02-08 14:12:31,985 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 626 flow [2025-02-08 14:12:31,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2025-02-08 14:12:31,990 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 45 predicate places. [2025-02-08 14:12:31,991 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 626 flow [2025-02-08 14:12:31,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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:12:31,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:31,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:12:31,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:31,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1450636541, now seen corresponding path program 1 times [2025-02-08 14:12:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211349331] [2025-02-08 14:12:31,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:32,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:12:32,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:12:32,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:32,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:32,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211349331] [2025-02-08 14:12:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211349331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:32,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954057917] [2025-02-08 14:12:32,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:32,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:32,314 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:12:32,315 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:12:32,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:12:32,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:12:32,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:32,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:32,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 14:12:32,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:32,454 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:12:32,530 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:12:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:32,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:32,697 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:12:32,702 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:12:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954057917] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:32,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-08 14:12:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749876258] [2025-02-08 14:12:32,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 14:12:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:32,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:12:32,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-02-08 14:12:32,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-02-08 14:12:32,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 626 flow. Second operand has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 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:12:32,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:32,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-02-08 14:12:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:36,170 INFO L124 PetriNetUnfolderBase]: 19190/38983 cut-off events. [2025-02-08 14:12:36,170 INFO L125 PetriNetUnfolderBase]: For 22439/23494 co-relation queries the response was YES. [2025-02-08 14:12:36,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89770 conditions, 38983 events. 19190/38983 cut-off events. For 22439/23494 co-relation queries the response was YES. Maximal size of possible extension queue 1824. Compared 414461 event pairs, 8540 based on Foata normal form. 614/36120 useless extension candidates. Maximal degree in co-relation 89677. Up to 10166 conditions per place. [2025-02-08 14:12:36,423 INFO L140 encePairwiseOnDemand]: 75/89 looper letters, 212 selfloop transitions, 46 changer transitions 22/314 dead transitions. [2025-02-08 14:12:36,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 314 transitions, 1912 flow [2025-02-08 14:12:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 14:12:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 14:12:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1005 transitions. [2025-02-08 14:12:36,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943228858663513 [2025-02-08 14:12:36,434 INFO L175 Difference]: Start difference. First operand has 131 places, 119 transitions, 626 flow. Second operand 19 states and 1005 transitions. [2025-02-08 14:12:36,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 314 transitions, 1912 flow [2025-02-08 14:12:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 314 transitions, 1870 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:12:36,803 INFO L231 Difference]: Finished difference. Result has 150 places, 127 transitions, 762 flow [2025-02-08 14:12:36,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=762, PETRI_PLACES=150, PETRI_TRANSITIONS=127} [2025-02-08 14:12:36,803 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 64 predicate places. [2025-02-08 14:12:36,803 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 127 transitions, 762 flow [2025-02-08 14:12:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.82608695652174) internal successors, (985), 23 states have internal predecessors, (985), 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:12:36,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:36,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:36,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 14:12:37,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:37,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:37,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2020029922, now seen corresponding path program 1 times [2025-02-08 14:12:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483839728] [2025-02-08 14:12:37,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:37,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:12:37,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:12:37,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:37,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483839728] [2025-02-08 14:12:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483839728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890257750] [2025-02-08 14:12:37,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:37,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:37,250 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:12:37,251 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:12:37,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:12:37,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:12:37,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:37,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:37,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 14:12:37,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:37,396 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:12:37,478 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:12:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:37,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:37,582 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:12:37,585 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:12:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:37,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890257750] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:37,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:37,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-02-08 14:12:37,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109234408] [2025-02-08 14:12:37,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:37,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 14:12:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:37,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:12:37,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-02-08 14:12:37,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 89 [2025-02-08 14:12:37,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 127 transitions, 762 flow. Second operand has 25 states, 25 states have (on average 40.84) internal successors, (1021), 25 states have internal predecessors, (1021), 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:12:37,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:37,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 89 [2025-02-08 14:12:37,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:42,322 INFO L124 PetriNetUnfolderBase]: 23464/43596 cut-off events. [2025-02-08 14:12:42,323 INFO L125 PetriNetUnfolderBase]: For 28059/29346 co-relation queries the response was YES. [2025-02-08 14:12:42,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106393 conditions, 43596 events. 23464/43596 cut-off events. For 28059/29346 co-relation queries the response was YES. Maximal size of possible extension queue 1992. Compared 433826 event pairs, 12516 based on Foata normal form. 818/41314 useless extension candidates. Maximal degree in co-relation 106285. Up to 14926 conditions per place. [2025-02-08 14:12:42,643 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 215 selfloop transitions, 48 changer transitions 4/298 dead transitions. [2025-02-08 14:12:42,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 298 transitions, 1914 flow [2025-02-08 14:12:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 14:12:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 14:12:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 913 transitions. [2025-02-08 14:12:42,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5699126092384519 [2025-02-08 14:12:42,649 INFO L175 Difference]: Start difference. First operand has 150 places, 127 transitions, 762 flow. Second operand 18 states and 913 transitions. [2025-02-08 14:12:42,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 298 transitions, 1914 flow [2025-02-08 14:12:42,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 298 transitions, 1843 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 14:12:42,864 INFO L231 Difference]: Finished difference. Result has 157 places, 133 transitions, 815 flow [2025-02-08 14:12:42,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=815, PETRI_PLACES=157, PETRI_TRANSITIONS=133} [2025-02-08 14:12:42,866 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 71 predicate places. [2025-02-08 14:12:42,866 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 133 transitions, 815 flow [2025-02-08 14:12:42,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 40.84) internal successors, (1021), 25 states have internal predecessors, (1021), 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:12:42,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:42,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:42,875 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:12:43,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 14:12:43,068 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:43,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:43,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1803580992, now seen corresponding path program 1 times [2025-02-08 14:12:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119013740] [2025-02-08 14:12:43,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:43,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:12:43,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:12:43,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:43,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:12:43,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:43,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119013740] [2025-02-08 14:12:43,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119013740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:43,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:43,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:12:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609844992] [2025-02-08 14:12:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:43,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:43,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:43,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:43,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 89 [2025-02-08 14:12:43,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 133 transitions, 815 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:43,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:43,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 89 [2025-02-08 14:12:43,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:45,774 INFO L124 PetriNetUnfolderBase]: 22183/42864 cut-off events. [2025-02-08 14:12:45,774 INFO L125 PetriNetUnfolderBase]: For 30508/31204 co-relation queries the response was YES. [2025-02-08 14:12:46,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104515 conditions, 42864 events. 22183/42864 cut-off events. For 30508/31204 co-relation queries the response was YES. Maximal size of possible extension queue 1938. Compared 439962 event pairs, 9597 based on Foata normal form. 902/40475 useless extension candidates. Maximal degree in co-relation 104405. Up to 14225 conditions per place. [2025-02-08 14:12:46,151 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 143 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2025-02-08 14:12:46,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 182 transitions, 1285 flow [2025-02-08 14:12:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-02-08 14:12:46,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7134831460674157 [2025-02-08 14:12:46,153 INFO L175 Difference]: Start difference. First operand has 157 places, 133 transitions, 815 flow. Second operand 4 states and 254 transitions. [2025-02-08 14:12:46,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 182 transitions, 1285 flow [2025-02-08 14:12:46,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 182 transitions, 1217 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-02-08 14:12:46,368 INFO L231 Difference]: Finished difference. Result has 148 places, 130 transitions, 735 flow [2025-02-08 14:12:46,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=735, PETRI_PLACES=148, PETRI_TRANSITIONS=130} [2025-02-08 14:12:46,369 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 62 predicate places. [2025-02-08 14:12:46,369 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 130 transitions, 735 flow [2025-02-08 14:12:46,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:12:46,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:46,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:46,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 14:12:46,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:12:46,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1803581985, now seen corresponding path program 1 times [2025-02-08 14:12:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338336948] [2025-02-08 14:12:46,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:46,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:12:46,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:12:46,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:46,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:46,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338336948] [2025-02-08 14:12:46,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338336948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:46,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501445455] [2025-02-08 14:12:46,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:46,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:46,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:46,947 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:12:46,950 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:12:47,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:12:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:12:47,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:47,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:47,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 14:12:47,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:47,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:12:47,053 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:12:47,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:12:47,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:12:47,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:12:47,225 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:12:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:47,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:47,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:47,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-08 14:12:47,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:47,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-02-08 14:12:47,577 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 15 treesize of output 9 [2025-02-08 14:12:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:12:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501445455] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:47,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-08 14:12:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177628011] [2025-02-08 14:12:47,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:47,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 14:12:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:47,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 14:12:47,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=619, Unknown=1, NotChecked=0, Total=702 [2025-02-08 14:12:47,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-02-08 14:12:47,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 130 transitions, 735 flow. Second operand has 27 states, 27 states have (on average 33.074074074074076) internal successors, (893), 27 states have internal predecessors, (893), 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:12:47,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:47,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-02-08 14:12:47,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:53,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 14:13:02,330 INFO L124 PetriNetUnfolderBase]: 63729/100151 cut-off events. [2025-02-08 14:13:02,330 INFO L125 PetriNetUnfolderBase]: For 64857/67953 co-relation queries the response was YES. [2025-02-08 14:13:02,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263212 conditions, 100151 events. 63729/100151 cut-off events. For 64857/67953 co-relation queries the response was YES. Maximal size of possible extension queue 4010. Compared 902873 event pairs, 15467 based on Foata normal form. 1591/94983 useless extension candidates. Maximal degree in co-relation 263102. Up to 19454 conditions per place. [2025-02-08 14:13:03,154 INFO L140 encePairwiseOnDemand]: 73/89 looper letters, 566 selfloop transitions, 74 changer transitions 21/684 dead transitions. [2025-02-08 14:13:03,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 684 transitions, 4164 flow [2025-02-08 14:13:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 14:13:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-02-08 14:13:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1820 transitions. [2025-02-08 14:13:03,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4987667854206632 [2025-02-08 14:13:03,157 INFO L175 Difference]: Start difference. First operand has 148 places, 130 transitions, 735 flow. Second operand 41 states and 1820 transitions. [2025-02-08 14:13:03,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 684 transitions, 4164 flow [2025-02-08 14:13:03,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 684 transitions, 4142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:13:03,953 INFO L231 Difference]: Finished difference. Result has 199 places, 161 transitions, 1144 flow [2025-02-08 14:13:03,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1144, PETRI_PLACES=199, PETRI_TRANSITIONS=161} [2025-02-08 14:13:03,954 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 113 predicate places. [2025-02-08 14:13:03,954 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 161 transitions, 1144 flow [2025-02-08 14:13:03,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 33.074074074074076) internal successors, (893), 27 states have internal predecessors, (893), 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:03,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:13:03,954 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:13:03,961 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:04,159 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,SelfDestructingSolverStorable17 [2025-02-08 14:13:04,159 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 40 more)] === [2025-02-08 14:13:04,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:13:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1114497382, now seen corresponding path program 2 times [2025-02-08 14:13:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:13:04,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22356000] [2025-02-08 14:13:04,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:04,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:13:04,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 14:13:04,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:13:04,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:04,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:13:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22356000] [2025-02-08 14:13:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22356000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:13:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974981929] [2025-02-08 14:13:04,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:13:04,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:13:04,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:13:04,258 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:04,260 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:04,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 14:13:04,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:13:04,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:13:04,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:13:04,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:13:04,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:13:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:04,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:13:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:13:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974981929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:13:04,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:13:04,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-08 14:13:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085240350] [2025-02-08 14:13:04,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:13:04,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 14:13:04,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:13:04,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 14:13:04,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-02-08 14:13:04,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 89 [2025-02-08 14:13:04,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 161 transitions, 1144 flow. Second operand has 20 states, 20 states have (on average 45.55) internal successors, (911), 20 states have internal predecessors, (911), 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:04,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:13:04,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 89 [2025-02-08 14:13:04,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand