./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-poker-hand-symm.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/chl-poker-hand-symm.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 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:08:58,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:08:58,176 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:08:58,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:08:58,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:08:58,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:08:58,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:08:58,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:08:58,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:08:58,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:08:58,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:08:58,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:08:58,235 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:08:58,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:08:58,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:08:58,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:08:58,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:08:58,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:08:58,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:08:58,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:08:58,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:08:58,243 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 -> 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 [2025-02-08 14:08:58,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:08:58,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:08:58,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:08:58,730 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:08:58,730 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:08:58,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-poker-hand-symm.wvr.c [2025-02-08 14:09:00,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a36daf55/5f3ea8abf3f549f99a3f919e6b378798/FLAGdd5883fe1 [2025-02-08 14:09:00,430 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:09:00,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-poker-hand-symm.wvr.c [2025-02-08 14:09:00,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a36daf55/5f3ea8abf3f549f99a3f919e6b378798/FLAGdd5883fe1 [2025-02-08 14:09:00,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a36daf55/5f3ea8abf3f549f99a3f919e6b378798 [2025-02-08 14:09:00,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:09:00,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:09:00,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:00,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:09:00,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:09:00,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:00" (1/1) ... [2025-02-08 14:09:00,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2854d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:00, skipping insertion in model container [2025-02-08 14:09:00,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:00" (1/1) ... [2025-02-08 14:09:00,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:09:00,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:00,945 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:09:00,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:01,016 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:09:01,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01 WrapperNode [2025-02-08 14:09:01,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:01,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:01,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:09:01,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:09:01,024 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:09:01" (1/1) ... [2025-02-08 14:09:01,044 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:09:01" (1/1) ... [2025-02-08 14:09:01,100 INFO L138 Inliner]: procedures = 24, calls = 298, calls flagged for inlining = 70, calls inlined = 98, statements flattened = 1667 [2025-02-08 14:09:01,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:01,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:09:01,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:09:01,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:09:01,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,187 INFO L175 MemorySlicer]: Split 186 memory accesses to 2 slices as follows [2, 184]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2025-02-08 14:09:01,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:09:01,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:09:01,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:09:01,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:09:01,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (1/1) ... [2025-02-08 14:09:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:01,403 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:09:01,406 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:09:01,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:09:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:09:01,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:09:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:09:01,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:09:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:09:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:09:01,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:09:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:09:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:09:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:09:01,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:09:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:09:01,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:09:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:09:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:09:01,440 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:09:01,649 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:09:01,651 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:09:02,525 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret114#1 && #t~ret114#1 <= 2147483647; [2025-02-08 14:09:02,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:02,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-6: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:02,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-7: #t~ret114#1 := minus_#res#1; [2025-02-08 14:09:02,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: [2025-02-08 14:09:02,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: #t~ite34#1 := #t~ret33#1; [2025-02-08 14:09:02,526 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret33#1 && #t~ret33#1 <= 2147483647; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: #t~ret33#1 := minus_#res#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret44#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-1: havoc #t~mem43#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-2: havoc #t~mem42#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-3: ~result_8~0 := #t~ret44#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret44#1 && #t~ret44#1 <= 2147483647; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-6: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71-7: #t~ret44#1 := minus_#res#1; [2025-02-08 14:09:02,527 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L72: [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-5: #t~ite95#1 := #t~ret94#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret94#1 && #t~ret94#1 <= 2147483647; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-8: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-9: #t~ret94#1 := minus_#res#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc #t~ret114#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-1: havoc #t~mem113#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-2: havoc #t~mem112#1; [2025-02-08 14:09:02,528 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-3: ~result_8~0 := #t~ret114#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-5: #t~ite250#1 := #t~ret249#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret249#1 && #t~ret249#1 <= 2147483647; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-8: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-9: #t~ret249#1 := minus_#res#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc #t~ret269#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-1: havoc #t~mem268#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-2: havoc #t~mem267#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-3: ~result_13~0 := #t~ret269#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret269#1 && #t~ret269#1 <= 2147483647; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-6: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-7: #t~ret269#1 := minus_#res#1; [2025-02-08 14:09:03,320 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-5: #t~ite189#1 := #t~ret188#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret188#1 && #t~ret188#1 <= 2147483647; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-8: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-9: #t~ret188#1 := minus_#res#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155: havoc #t~ret199#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-1: havoc #t~mem198#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-2: havoc #t~mem197#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-3: ~result_13~0 := #t~ret199#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret199#1 && #t~ret199#1 <= 2147483647; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-6: havoc minus_#t~short326#1, minus_#t~short327#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L155-7: #t~ret199#1 := minus_#res#1; [2025-02-08 14:09:03,321 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: [2025-02-08 14:09:03,743 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:09:03,744 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:09:05,843 WARN L170 LargeBlockEncoding]: Complex 2:5 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 14:09:05,934 WARN L170 LargeBlockEncoding]: Complex 2:5 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-08 14:09:05,982 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254 is not an error location. [2025-02-08 14:09:05,982 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-4 is not an error location. [2025-02-08 14:09:05,982 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-8 is not an error location. [2025-02-08 14:09:05,983 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-12 is not an error location. [2025-02-08 14:09:05,983 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-12 is not an error location. [2025-02-08 14:09:05,983 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-8 is not an error location. [2025-02-08 14:09:05,984 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-12 is not an error location. [2025-02-08 14:09:05,984 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-12 is not an error location. [2025-02-08 14:09:05,984 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254 is not an error location. [2025-02-08 14:09:05,984 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L254-4 is not an error location. [2025-02-08 14:09:05,985 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:09:05,986 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:09:05,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:05 BoogieIcfgContainer [2025-02-08 14:09:05,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:09:05,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:09:05,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:09:05,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:09:05,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:09:00" (1/3) ... [2025-02-08 14:09:05,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421ed5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:05, skipping insertion in model container [2025-02-08 14:09:05,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:01" (2/3) ... [2025-02-08 14:09:05,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421ed5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:05, skipping insertion in model container [2025-02-08 14:09:05,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:05" (3/3) ... [2025-02-08 14:09:05,995 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2025-02-08 14:09:06,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:09:06,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-poker-hand-symm.wvr.c that has 3 procedures, 160 locations, 1 initial locations, 12 loop locations, and 70 error locations. [2025-02-08 14:09:06,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:09:06,657 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:09:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 193 transitions, 400 flow [2025-02-08 14:09:06,815 INFO L124 PetriNetUnfolderBase]: 34/191 cut-off events. [2025-02-08 14:09:06,816 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:09:06,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 191 events. 34/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 919 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 137. Up to 5 conditions per place. [2025-02-08 14:09:06,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 193 transitions, 400 flow [2025-02-08 14:09:06,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 190 transitions, 392 flow [2025-02-08 14:09:06,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:09:06,853 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;@1537dec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:09:06,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2025-02-08 14:09:06,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:09:06,858 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:09:06,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:09:06,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:06,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:09:06,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:06,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash 4604023, now seen corresponding path program 1 times [2025-02-08 14:09:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:06,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362669766] [2025-02-08 14:09:06,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:06,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:09:06,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:09:06,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:06,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:07,133 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:09:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362669766] [2025-02-08 14:09:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362669766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:07,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634372079] [2025-02-08 14:09:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:07,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:07,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:07,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:07,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:07,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 190 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:07,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:07,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:10,709 INFO L124 PetriNetUnfolderBase]: 7508/11760 cut-off events. [2025-02-08 14:09:10,709 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-02-08 14:09:10,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23645 conditions, 11760 events. 7508/11760 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 74920 event pairs, 6028 based on Foata normal form. 10/6439 useless extension candidates. Maximal degree in co-relation 23248. Up to 11721 conditions per place. [2025-02-08 14:09:10,789 INFO L140 encePairwiseOnDemand]: 122/193 looper letters, 149 selfloop transitions, 25 changer transitions 2/184 dead transitions. [2025-02-08 14:09:10,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 184 transitions, 730 flow [2025-02-08 14:09:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-02-08 14:09:10,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3432642487046632 [2025-02-08 14:09:10,805 INFO L175 Difference]: Start difference. First operand has 163 places, 190 transitions, 392 flow. Second operand 4 states and 265 transitions. [2025-02-08 14:09:10,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 184 transitions, 730 flow [2025-02-08 14:09:10,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 184 transitions, 722 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:10,891 INFO L231 Difference]: Finished difference. Result has 145 places, 182 transitions, 547 flow [2025-02-08 14:09:10,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=547, PETRI_PLACES=145, PETRI_TRANSITIONS=182} [2025-02-08 14:09:10,900 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -18 predicate places. [2025-02-08 14:09:10,905 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 182 transitions, 547 flow [2025-02-08 14:09:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:10,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:10,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:09:10,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:09:10,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:10,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash -276091495, now seen corresponding path program 1 times [2025-02-08 14:09:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748407377] [2025-02-08 14:09:10,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:10,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:11,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:11,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:11,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:11,249 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:09:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748407377] [2025-02-08 14:09:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748407377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358895927] [2025-02-08 14:09:11,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:11,256 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:09:11,257 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:09:11,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:11,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:11,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:11,714 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:09:11,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:09:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358895927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:09:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:09:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059732464] [2025-02-08 14:09:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:11,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:11,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:11,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:09:11,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:11,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 182 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:09:11,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:11,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:11,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:14,970 INFO L124 PetriNetUnfolderBase]: 7508/11750 cut-off events. [2025-02-08 14:09:14,970 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 14:09:14,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23617 conditions, 11750 events. 7508/11750 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 74859 event pairs, 6028 based on Foata normal form. 8/6442 useless extension candidates. Maximal degree in co-relation 23429. Up to 11680 conditions per place. [2025-02-08 14:09:15,024 INFO L140 encePairwiseOnDemand]: 160/193 looper letters, 124 selfloop transitions, 42 changer transitions 0/174 dead transitions. [2025-02-08 14:09:15,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 174 transitions, 847 flow [2025-02-08 14:09:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2025-02-08 14:09:15,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20725388601036268 [2025-02-08 14:09:15,027 INFO L175 Difference]: Start difference. First operand has 145 places, 182 transitions, 547 flow. Second operand 6 states and 240 transitions. [2025-02-08 14:09:15,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 174 transitions, 847 flow [2025-02-08 14:09:15,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 174 transitions, 847 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:09:15,031 INFO L231 Difference]: Finished difference. Result has 140 places, 174 transitions, 599 flow [2025-02-08 14:09:15,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=599, PETRI_PLACES=140, PETRI_TRANSITIONS=174} [2025-02-08 14:09:15,032 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -23 predicate places. [2025-02-08 14:09:15,032 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 174 transitions, 599 flow [2025-02-08 14:09:15,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:09:15,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:15,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:09:15,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:09:15,233 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:09:15,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:15,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash 31102689, now seen corresponding path program 1 times [2025-02-08 14:09:15,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:15,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25009565] [2025-02-08 14:09:15,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:09:15,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:09:15,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:15,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:15,348 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:09:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25009565] [2025-02-08 14:09:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25009565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101139648] [2025-02-08 14:09:15,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:15,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:15,352 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:09:15,354 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:09:15,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:09:15,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:09:15,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:15,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:15,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:15,767 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:09:15,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:15,805 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:09:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101139648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:15,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:09:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091326505] [2025-02-08 14:09:15,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:09:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:15,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:09:15,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:09:15,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:15,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 174 transitions, 599 flow. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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:09:15,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:15,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:18,577 INFO L124 PetriNetUnfolderBase]: 7532/11846 cut-off events. [2025-02-08 14:09:18,577 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-02-08 14:09:18,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23993 conditions, 11846 events. 7532/11846 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 75790 event pairs, 6028 based on Foata normal form. 24/6559 useless extension candidates. Maximal degree in co-relation 23431. Up to 11715 conditions per place. [2025-02-08 14:09:18,611 INFO L140 encePairwiseOnDemand]: 160/193 looper letters, 141 selfloop transitions, 97 changer transitions 0/246 dead transitions. [2025-02-08 14:09:18,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 246 transitions, 1549 flow [2025-02-08 14:09:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:09:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:09:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 372 transitions. [2025-02-08 14:09:18,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1927461139896373 [2025-02-08 14:09:18,617 INFO L175 Difference]: Start difference. First operand has 140 places, 174 transitions, 599 flow. Second operand 10 states and 372 transitions. [2025-02-08 14:09:18,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 246 transitions, 1549 flow [2025-02-08 14:09:18,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 246 transitions, 1341 flow, removed 36 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:18,624 INFO L231 Difference]: Finished difference. Result has 147 places, 246 transitions, 1189 flow [2025-02-08 14:09:18,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1189, PETRI_PLACES=147, PETRI_TRANSITIONS=246} [2025-02-08 14:09:18,625 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -16 predicate places. [2025-02-08 14:09:18,626 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 246 transitions, 1189 flow [2025-02-08 14:09:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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:09:18,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:18,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:18,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:18,828 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:09:18,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -510654879, now seen corresponding path program 1 times [2025-02-08 14:09:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664079826] [2025-02-08 14:09:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:18,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:09:18,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:09:18,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:18,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:18,985 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:09:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664079826] [2025-02-08 14:09:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664079826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345451443] [2025-02-08 14:09:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:18,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:18,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:18,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 193 [2025-02-08 14:09:18,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 246 transitions, 1189 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:18,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:18,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 193 [2025-02-08 14:09:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:20,918 INFO L124 PetriNetUnfolderBase]: 7530/11844 cut-off events. [2025-02-08 14:09:20,919 INFO L125 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2025-02-08 14:09:20,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24046 conditions, 11844 events. 7530/11844 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 75714 event pairs, 6028 based on Foata normal form. 2/6531 useless extension candidates. Maximal degree in co-relation 23793. Up to 11790 conditions per place. [2025-02-08 14:09:20,950 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 221 selfloop transitions, 7 changer transitions 0/244 dead transitions. [2025-02-08 14:09:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 1637 flow [2025-02-08 14:09:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-02-08 14:09:20,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38169257340241797 [2025-02-08 14:09:20,951 INFO L175 Difference]: Start difference. First operand has 147 places, 246 transitions, 1189 flow. Second operand 3 states and 221 transitions. [2025-02-08 14:09:20,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 1637 flow [2025-02-08 14:09:20,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 244 transitions, 1535 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:20,960 INFO L231 Difference]: Finished difference. Result has 147 places, 244 transitions, 1093 flow [2025-02-08 14:09:20,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=147, PETRI_TRANSITIONS=244} [2025-02-08 14:09:20,960 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -16 predicate places. [2025-02-08 14:09:20,961 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 244 transitions, 1093 flow [2025-02-08 14:09:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:20,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:20,961 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:09:20,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:09:20,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:20,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1166997059, now seen corresponding path program 2 times [2025-02-08 14:09:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:20,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694361389] [2025-02-08 14:09:20,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:20,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:09:20,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:09:20,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:21,019 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:09:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694361389] [2025-02-08 14:09:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694361389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438677693] [2025-02-08 14:09:21,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:21,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:21,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:21,024 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:09:21,041 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:09:21,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:09:21,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:09:21,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:21,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:21,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:21,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:21,538 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:09:21,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:21,579 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:09:21,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438677693] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:21,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:21,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 14:09:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133323375] [2025-02-08 14:09:21,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:21,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:21,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:21,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:09:21,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:21,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 244 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:09:21,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:21,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:21,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:23,908 INFO L124 PetriNetUnfolderBase]: 7530/11836 cut-off events. [2025-02-08 14:09:23,909 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2025-02-08 14:09:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23953 conditions, 11836 events. 7530/11836 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 75576 event pairs, 6028 based on Foata normal form. 8/6530 useless extension candidates. Maximal degree in co-relation 23860. Up to 11683 conditions per place. [2025-02-08 14:09:23,946 INFO L140 encePairwiseOnDemand]: 166/193 looper letters, 137 selfloop transitions, 91 changer transitions 0/236 dead transitions. [2025-02-08 14:09:23,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 236 transitions, 1469 flow [2025-02-08 14:09:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-02-08 14:09:23,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.17962003454231434 [2025-02-08 14:09:23,949 INFO L175 Difference]: Start difference. First operand has 147 places, 244 transitions, 1093 flow. Second operand 6 states and 208 transitions. [2025-02-08 14:09:23,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 236 transitions, 1469 flow [2025-02-08 14:09:23,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 236 transitions, 1382 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:23,954 INFO L231 Difference]: Finished difference. Result has 139 places, 236 transitions, 1108 flow [2025-02-08 14:09:23,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1108, PETRI_PLACES=139, PETRI_TRANSITIONS=236} [2025-02-08 14:09:23,954 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -24 predicate places. [2025-02-08 14:09:23,954 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 236 transitions, 1108 flow [2025-02-08 14:09:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:09:23,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:23,955 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:09:23,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 14:09:24,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:24,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:24,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -165028863, now seen corresponding path program 1 times [2025-02-08 14:09:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:24,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92946589] [2025-02-08 14:09:24,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:24,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:09:24,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:09:24,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:24,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:24,323 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:09:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92946589] [2025-02-08 14:09:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92946589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900827391] [2025-02-08 14:09:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:24,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:24,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:24,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:24,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 193 [2025-02-08 14:09:24,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 236 transitions, 1108 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:09:24,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:24,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 193 [2025-02-08 14:09:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:26,800 INFO L124 PetriNetUnfolderBase]: 7526/11832 cut-off events. [2025-02-08 14:09:26,800 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2025-02-08 14:09:26,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23985 conditions, 11832 events. 7526/11832 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 75216 event pairs, 6028 based on Foata normal form. 4/6521 useless extension candidates. Maximal degree in co-relation 23400. Up to 11773 conditions per place. [2025-02-08 14:09:26,838 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 204 selfloop transitions, 20 changer transitions 0/232 dead transitions. [2025-02-08 14:09:26,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 232 transitions, 1538 flow [2025-02-08 14:09:26,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-02-08 14:09:26,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3920552677029361 [2025-02-08 14:09:26,839 INFO L175 Difference]: Start difference. First operand has 139 places, 236 transitions, 1108 flow. Second operand 3 states and 227 transitions. [2025-02-08 14:09:26,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 232 transitions, 1538 flow [2025-02-08 14:09:26,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 232 transitions, 1358 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:26,844 INFO L231 Difference]: Finished difference. Result has 136 places, 232 transitions, 950 flow [2025-02-08 14:09:26,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=950, PETRI_PLACES=136, PETRI_TRANSITIONS=232} [2025-02-08 14:09:26,851 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -27 predicate places. [2025-02-08 14:09:26,852 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 232 transitions, 950 flow [2025-02-08 14:09:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:09:26,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:26,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:26,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:09:26,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:26,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1412945062, now seen corresponding path program 1 times [2025-02-08 14:09:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:26,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927476545] [2025-02-08 14:09:26,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:26,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 14:09:26,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:09:26,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:26,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:09:27,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927476545] [2025-02-08 14:09:27,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927476545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:27,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:27,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961449001] [2025-02-08 14:09:27,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:27,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:27,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:27,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:27,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:27,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 193 [2025-02-08 14:09:27,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 232 transitions, 950 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:09:27,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:27,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 193 [2025-02-08 14:09:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:28,820 INFO L124 PetriNetUnfolderBase]: 7524/11830 cut-off events. [2025-02-08 14:09:28,820 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-02-08 14:09:28,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23909 conditions, 11830 events. 7524/11830 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 74988 event pairs, 6028 based on Foata normal form. 2/6509 useless extension candidates. Maximal degree in co-relation 23568. Up to 11781 conditions per place. [2025-02-08 14:09:28,855 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 212 selfloop transitions, 10 changer transitions 0/230 dead transitions. [2025-02-08 14:09:28,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 230 transitions, 1385 flow [2025-02-08 14:09:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-02-08 14:09:28,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38169257340241797 [2025-02-08 14:09:28,884 INFO L175 Difference]: Start difference. First operand has 136 places, 232 transitions, 950 flow. Second operand 3 states and 221 transitions. [2025-02-08 14:09:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 230 transitions, 1385 flow [2025-02-08 14:09:28,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 230 transitions, 1328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:28,897 INFO L231 Difference]: Finished difference. Result has 136 places, 230 transitions, 904 flow [2025-02-08 14:09:28,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=136, PETRI_TRANSITIONS=230} [2025-02-08 14:09:28,902 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -27 predicate places. [2025-02-08 14:09:28,902 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 230 transitions, 904 flow [2025-02-08 14:09:28,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:09:28,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:28,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:28,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:09:28,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:28,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1103046859, now seen corresponding path program 1 times [2025-02-08 14:09:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078247907] [2025-02-08 14:09:28,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:28,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:09:28,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:09:28,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:28,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:09:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078247907] [2025-02-08 14:09:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078247907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866973508] [2025-02-08 14:09:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:29,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:29,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:09:29,080 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:09:29,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 14:09:29,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 14:09:29,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:29,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:29,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:09:29,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:09:29,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:09:29,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866973508] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:29,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-02-08 14:09:29,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711126235] [2025-02-08 14:09:29,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:29,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 14:09:29,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:29,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:09:29,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:09:29,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:29,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 230 transitions, 904 flow. Second operand has 11 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 states have internal predecessors, (162), 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:09:29,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:29,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:29,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:31,960 INFO L124 PetriNetUnfolderBase]: 7512/11818 cut-off events. [2025-02-08 14:09:31,961 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-02-08 14:09:31,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23840 conditions, 11818 events. 7512/11818 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 74654 event pairs, 6028 based on Foata normal form. 3/6499 useless extension candidates. Maximal degree in co-relation 23442. Up to 11708 conditions per place. [2025-02-08 14:09:31,994 INFO L140 encePairwiseOnDemand]: 168/193 looper letters, 119 selfloop transitions, 91 changer transitions 0/218 dead transitions. [2025-02-08 14:09:31,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 218 transitions, 1251 flow [2025-02-08 14:09:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 14:09:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 14:09:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 321 transitions. [2025-02-08 14:09:32,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1279394180948585 [2025-02-08 14:09:32,006 INFO L175 Difference]: Start difference. First operand has 136 places, 230 transitions, 904 flow. Second operand 13 states and 321 transitions. [2025-02-08 14:09:32,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 218 transitions, 1251 flow [2025-02-08 14:09:32,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 218 transitions, 1244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:32,009 INFO L231 Difference]: Finished difference. Result has 147 places, 218 transitions, 1006 flow [2025-02-08 14:09:32,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1006, PETRI_PLACES=147, PETRI_TRANSITIONS=218} [2025-02-08 14:09:32,011 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -16 predicate places. [2025-02-08 14:09:32,012 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 218 transitions, 1006 flow [2025-02-08 14:09:32,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.727272727272727) internal successors, (162), 11 states have internal predecessors, (162), 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:09:32,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:32,012 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:32,021 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:09:32,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 14:09:32,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:32,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1147198035, now seen corresponding path program 1 times [2025-02-08 14:09:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:32,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822277666] [2025-02-08 14:09:32,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:32,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:09:32,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:09:32,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:32,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-08 14:09:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822277666] [2025-02-08 14:09:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822277666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557059541] [2025-02-08 14:09:32,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:32,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:32,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:32,767 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:09:32,769 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:09:33,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:09:33,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:09:33,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:33,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:33,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:09:33,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-08 14:09:33,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-08 14:09:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557059541] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:33,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:33,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-08 14:09:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630607460] [2025-02-08 14:09:33,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:33,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 14:09:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:33,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 14:09:33,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-02-08 14:09:33,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:33,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 218 transitions, 1006 flow. Second operand has 18 states, 18 states have (on average 13.555555555555555) internal successors, (244), 18 states have internal predecessors, (244), 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:09:33,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:33,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:33,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:36,296 INFO L124 PetriNetUnfolderBase]: 7500/11810 cut-off events. [2025-02-08 14:09:36,296 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-02-08 14:09:36,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23891 conditions, 11810 events. 7500/11810 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 74590 event pairs, 6028 based on Foata normal form. 2/6498 useless extension candidates. Maximal degree in co-relation 23403. Up to 11691 conditions per place. [2025-02-08 14:09:36,332 INFO L140 encePairwiseOnDemand]: 168/193 looper letters, 118 selfloop transitions, 84 changer transitions 0/210 dead transitions. [2025-02-08 14:09:36,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 210 transitions, 1349 flow [2025-02-08 14:09:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 14:09:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 14:09:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 401 transitions. [2025-02-08 14:09:36,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12221883572081682 [2025-02-08 14:09:36,334 INFO L175 Difference]: Start difference. First operand has 147 places, 218 transitions, 1006 flow. Second operand 17 states and 401 transitions. [2025-02-08 14:09:36,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 210 transitions, 1349 flow [2025-02-08 14:09:36,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 210 transitions, 1301 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:36,340 INFO L231 Difference]: Finished difference. Result has 160 places, 210 transitions, 1131 flow [2025-02-08 14:09:36,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1131, PETRI_PLACES=160, PETRI_TRANSITIONS=210} [2025-02-08 14:09:36,342 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -3 predicate places. [2025-02-08 14:09:36,342 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 210 transitions, 1131 flow [2025-02-08 14:09:36,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.555555555555555) internal successors, (244), 18 states have internal predecessors, (244), 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:09:36,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:36,343 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:36,355 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:09:36,544 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:09:36,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:36,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1536895405, now seen corresponding path program 2 times [2025-02-08 14:09:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:36,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914798906] [2025-02-08 14:09:36,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:36,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-08 14:09:36,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 14:09:36,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:36,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-08 14:09:37,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:37,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914798906] [2025-02-08 14:09:37,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914798906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:37,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933721360] [2025-02-08 14:09:37,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:37,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:37,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:37,422 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:09:37,425 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:09:38,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-08 14:09:38,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 14:09:38,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:09:38,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:38,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 14:09:38,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-08 14:09:38,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-02-08 14:09:38,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933721360] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:38,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-02-08 14:09:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312706191] [2025-02-08 14:09:38,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:38,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 14:09:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:38,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 14:09:38,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 14:09:39,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:39,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 210 transitions, 1131 flow. Second operand has 35 states, 35 states have (on average 12.771428571428572) internal successors, (447), 35 states have internal predecessors, (447), 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:09:39,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:39,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:39,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:41,669 INFO L124 PetriNetUnfolderBase]: 7500/11846 cut-off events. [2025-02-08 14:09:41,669 INFO L125 PetriNetUnfolderBase]: For 654/654 co-relation queries the response was YES. [2025-02-08 14:09:41,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24166 conditions, 11846 events. 7500/11846 cut-off events. For 654/654 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 74594 event pairs, 6028 based on Foata normal form. 12/6551 useless extension candidates. Maximal degree in co-relation 23404. Up to 11691 conditions per place. [2025-02-08 14:09:41,715 INFO L140 encePairwiseOnDemand]: 168/193 looper letters, 118 selfloop transitions, 108 changer transitions 0/234 dead transitions. [2025-02-08 14:09:41,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 234 transitions, 1871 flow [2025-02-08 14:09:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 14:09:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 14:09:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 487 transitions. [2025-02-08 14:09:41,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.10970939400765939 [2025-02-08 14:09:41,719 INFO L175 Difference]: Start difference. First operand has 160 places, 210 transitions, 1131 flow. Second operand 23 states and 487 transitions. [2025-02-08 14:09:41,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 234 transitions, 1871 flow [2025-02-08 14:09:41,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 234 transitions, 1759 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-08 14:09:41,736 INFO L231 Difference]: Finished difference. Result has 178 places, 234 transitions, 1627 flow [2025-02-08 14:09:41,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1627, PETRI_PLACES=178, PETRI_TRANSITIONS=234} [2025-02-08 14:09:41,737 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 15 predicate places. [2025-02-08 14:09:41,737 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 234 transitions, 1627 flow [2025-02-08 14:09:41,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 12.771428571428572) internal successors, (447), 35 states have internal predecessors, (447), 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:09:41,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,737 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:41,747 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:09:41,938 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:09:41,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:41,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1666952755, now seen corresponding path program 3 times [2025-02-08 14:09:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106376874] [2025-02-08 14:09:41,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:09:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 12 equivalence classes. [2025-02-08 14:09:42,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 14:09:42,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 14:09:42,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-08 14:09:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106376874] [2025-02-08 14:09:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106376874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187806433] [2025-02-08 14:09:43,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:09:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:43,513 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:09:43,514 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:09:43,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 12 equivalence classes. [2025-02-08 14:09:54,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 14:09:54,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-08 14:09:54,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:54,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 14:09:54,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-08 14:09:55,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-02-08 14:09:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187806433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:55,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2025-02-08 14:09:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483320119] [2025-02-08 14:09:55,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-08 14:09:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:55,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-08 14:09:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2025-02-08 14:09:55,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 193 [2025-02-08 14:09:55,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 234 transitions, 1627 flow. Second operand has 50 states, 50 states have (on average 12.56) internal successors, (628), 50 states have internal predecessors, (628), 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:09:55,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:55,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 193 [2025-02-08 14:09:55,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:58,318 INFO L124 PetriNetUnfolderBase]: 7500/11858 cut-off events. [2025-02-08 14:09:58,318 INFO L125 PetriNetUnfolderBase]: For 1098/1098 co-relation queries the response was YES. [2025-02-08 14:09:58,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24347 conditions, 11858 events. 7500/11858 cut-off events. For 1098/1098 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 74594 event pairs, 6028 based on Foata normal form. 4/6555 useless extension candidates. Maximal degree in co-relation 23410. Up to 11691 conditions per place. [2025-02-08 14:09:58,347 INFO L140 encePairwiseOnDemand]: 168/193 looper letters, 118 selfloop transitions, 116 changer transitions 0/242 dead transitions. [2025-02-08 14:09:58,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 242 transitions, 2215 flow [2025-02-08 14:09:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-08 14:09:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-02-08 14:09:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 619 transitions. [2025-02-08 14:09:58,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.0916358253145818 [2025-02-08 14:09:58,350 INFO L175 Difference]: Start difference. First operand has 178 places, 234 transitions, 1627 flow. Second operand 35 states and 619 transitions. [2025-02-08 14:09:58,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 242 transitions, 2215 flow [2025-02-08 14:09:58,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 242 transitions, 2179 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:58,356 INFO L231 Difference]: Finished difference. Result has 210 places, 242 transitions, 1983 flow [2025-02-08 14:09:58,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1983, PETRI_PLACES=210, PETRI_TRANSITIONS=242} [2025-02-08 14:09:58,357 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 47 predicate places. [2025-02-08 14:09:58,357 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 242 transitions, 1983 flow [2025-02-08 14:09:58,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 12.56) internal successors, (628), 50 states have internal predecessors, (628), 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:09:58,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:58,357 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:58,378 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:09:58,559 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:09:58,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 121 more)] === [2025-02-08 14:09:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2086711085, now seen corresponding path program 4 times [2025-02-08 14:09:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177127380] [2025-02-08 14:09:58,560 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:09:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:58,588 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-02-08 14:09:58,743 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 14:09:58,743 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:09:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 12 proven. 150 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-08 14:10:01,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177127380] [2025-02-08 14:10:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177127380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940316762] [2025-02-08 14:10:01,615 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:10:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:01,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:01,621 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:10:01,622 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:10:02,130 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-02-08 14:10:02,252 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 14:10:02,252 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:10:02,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:02,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 247 conjuncts are in the unsatisfiable core [2025-02-08 14:10:02,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:02,312 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:10:02,527 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:10:02,580 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 14:10:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 14:10:02,618 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:10:02,643 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:10:02,663 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:10:02,686 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:10:02,710 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:10:02,764 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 14:10:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 14:10:02,777 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:10:02,797 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:10:02,821 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:10:02,841 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:10:02,868 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 14:10:02,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 14:10:02,909 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:10:02,931 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:10:02,958 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:10:02,982 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:10:03,070 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-08 14:10:03,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-08 14:10:03,127 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:10:03,183 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:10:03,225 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:10:03,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:10:03,406 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-02-08 14:10:03,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-02-08 14:10:03,506 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 33 treesize of output 13 [2025-02-08 14:10:03,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2025-02-08 14:10:03,921 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 33 treesize of output 13 [2025-02-08 14:10:04,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2025-02-08 14:10:04,241 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-08 14:10:04,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-08 14:10:04,326 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 14:10:04,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-08 14:10:04,547 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 14:10:04,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2025-02-08 14:10:04,758 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 14:10:04,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2025-02-08 14:10:04,963 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 14:10:04,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2025-02-08 14:10:05,187 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-02-08 14:10:05,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-02-08 14:10:05,392 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:05,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:05,631 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:05,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:05,875 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:05,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:06,100 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:06,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:06,316 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:06,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:06,597 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:06,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:06,841 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:06,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:07,079 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 14:10:07,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:07,195 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-02-08 14:10:07,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-02-08 14:10:07,254 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:10:07,352 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:10:07,449 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:10:07,572 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:10:07,716 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 25 treesize of output 13 [2025-02-08 14:10:07,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:07,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-08 14:10:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 14:10:08,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:14,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:10:14,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 114 [2025-02-08 14:10:31,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int))) (or (< (+ (select v_arrayElimArr_1 (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post325#1| 4) 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~index_of_0~0.base) (+ c_~index_of_0~0.offset 16)))))) is different from false