./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:00:47,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:00:47,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:00:47,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:00:47,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:00:47,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:00:47,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:00:47,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:00:47,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:00:47,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:00:47,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:00:47,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:00:47,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:00:47,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:00:47,196 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:00:47,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:00:47,197 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:00:47,198 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:00:47,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:00:47,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:00:47,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:00:47,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:00:47,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:47,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:47,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:47,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:47,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:00:47,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:47,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:47,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:47,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:47,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:00:47,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:00:47,200 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-01-10 06:00:47,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:00:47,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:00:47,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:00:47,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:00:47,495 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:00:47,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-01-10 06:00:48,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cea58327/335e1937517b4552aaa8c2dc67d1cfc3/FLAGa568bce5e [2025-01-10 06:00:49,161 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:00:49,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-01-10 06:00:49,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cea58327/335e1937517b4552aaa8c2dc67d1cfc3/FLAGa568bce5e [2025-01-10 06:00:49,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cea58327/335e1937517b4552aaa8c2dc67d1cfc3 [2025-01-10 06:00:49,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:00:49,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:00:49,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:49,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:00:49,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:00:49,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c3aeef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49, skipping insertion in model container [2025-01-10 06:00:49,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:00:49,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:49,714 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:00:49,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:49,853 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:00:49,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49 WrapperNode [2025-01-10 06:00:49,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:49,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:49,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:00:49,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:00:49,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,928 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 725 [2025-01-10 06:00:49,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:49,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:00:49,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:00:49,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:00:49,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,991 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 12, 3, 4, 4, 2, 4, 3, 3, 355, 2, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 0, 3, 3, 3, 0, 3, 3, 1, 355, 0, 0]. The 11 writes are split as follows [0, 0, 0, 5, 0, 0, 0, 2, 0, 0, 1, 0, 1, 2]. [2025-01-10 06:00:49,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:49,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:00:50,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:00:50,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:00:50,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:00:50,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (1/1) ... [2025-01-10 06:00:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:50,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:50,102 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-01-10 06:00:50,105 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-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:00:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 06:00:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:00:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:00:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 06:00:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 06:00:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:00:50,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:00:50,477 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:00:50,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:00:51,073 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2025-01-10 06:00:51,074 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:00:51,082 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:00:51,083 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:00:51,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:51 BoogieIcfgContainer [2025-01-10 06:00:51,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:00:51,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:00:51,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:00:51,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:00:51,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:49" (1/3) ... [2025-01-10 06:00:51,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451e4152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:51, skipping insertion in model container [2025-01-10 06:00:51,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:49" (2/3) ... [2025-01-10 06:00:51,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451e4152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:00:51, skipping insertion in model container [2025-01-10 06:00:51,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:51" (3/3) ... [2025-01-10 06:00:51,121 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-01-10 06:00:51,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:00:51,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 115 locations, 1 initial locations, 7 loop locations, and 24 error locations. [2025-01-10 06:00:51,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:00:51,185 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;@2a9636fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:00:51,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-10 06:00:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 87 states have (on average 1.7126436781609196) internal successors, (149), 111 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:00:51,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:51,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:00:51,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1171908, now seen corresponding path program 1 times [2025-01-10 06:00:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623708816] [2025-01-10 06:00:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:51,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:00:51,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:00:51,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:51,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:51,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623708816] [2025-01-10 06:00:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623708816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549019208] [2025-01-10 06:00:51,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:51,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:51,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:51,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:51,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:51,739 INFO L87 Difference]: Start difference. First operand has 115 states, 87 states have (on average 1.7126436781609196) internal successors, (149), 111 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 06:00:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:51,813 INFO L93 Difference]: Finished difference Result 227 states and 305 transitions. [2025-01-10 06:00:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-01-10 06:00:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:51,823 INFO L225 Difference]: With dead ends: 227 [2025-01-10 06:00:51,824 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 06:00:51,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:51,830 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:51,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 06:00:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-10 06:00:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.627906976744186) internal successors, (140), 109 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2025-01-10 06:00:51,868 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 4 [2025-01-10 06:00:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2025-01-10 06:00:51,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-10 06:00:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2025-01-10 06:00:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:00:51,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:51,870 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:00:51,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:00:51,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:51,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 552620398, now seen corresponding path program 1 times [2025-01-10 06:00:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515631771] [2025-01-10 06:00:51,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:00:51,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:00:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515631771] [2025-01-10 06:00:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515631771] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720151040] [2025-01-10 06:00:52,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:52,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:52,134 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-01-10 06:00:52,136 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-01-10 06:00:52,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:00:52,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:00:52,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:52,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:00:52,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:52,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:00:52,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720151040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:52,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:00:52,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:00:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649172582] [2025-01-10 06:00:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:52,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:00:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:52,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:00:52,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:52,475 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-01-10 06:00:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:52,509 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2025-01-10 06:00:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:00:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2025-01-10 06:00:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:52,511 INFO L225 Difference]: With dead ends: 113 [2025-01-10 06:00:52,511 INFO L226 Difference]: Without dead ends: 112 [2025-01-10 06:00:52,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:52,515 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:52,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-10 06:00:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-10 06:00:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 108 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2025-01-10 06:00:52,526 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 7 [2025-01-10 06:00:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:52,527 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2025-01-10 06:00:52,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-01-10 06:00:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2025-01-10 06:00:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:00:52,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:52,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:00:52,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:00:52,729 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-01-10 06:00:52,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:52,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -48636798, now seen corresponding path program 1 times [2025-01-10 06:00:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:52,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194934697] [2025-01-10 06:00:52,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:52,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:52,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:00:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:00:52,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:52,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:00:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194934697] [2025-01-10 06:00:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194934697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:52,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:52,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359016825] [2025-01-10 06:00:52,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:52,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:52,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:52,899 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 06:00:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:52,920 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2025-01-10 06:00:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-01-10 06:00:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:52,924 INFO L225 Difference]: With dead ends: 112 [2025-01-10 06:00:52,924 INFO L226 Difference]: Without dead ends: 111 [2025-01-10 06:00:52,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:52,925 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:52,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-10 06:00:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-01-10 06:00:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.619047619047619) internal successors, (136), 105 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2025-01-10 06:00:52,938 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 8 [2025-01-10 06:00:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:52,939 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2025-01-10 06:00:52,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 06:00:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2025-01-10 06:00:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:00:52,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:52,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:52,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:00:52,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash 419324344, now seen corresponding path program 1 times [2025-01-10 06:00:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972176465] [2025-01-10 06:00:52,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:52,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:52,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:00:52,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:00:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972176465] [2025-01-10 06:00:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972176465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019020193] [2025-01-10 06:00:53,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:53,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:53,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:53,129 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-01-10 06:00:53,131 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-01-10 06:00:53,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:00:53,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:00:53,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:53,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:53,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:00:53,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:00:53,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:00:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019020193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:53,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:00:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:00:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710134085] [2025-01-10 06:00:53,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:53,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:53,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:53,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:53,413 INFO L87 Difference]: Start difference. First operand 109 states and 140 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:53,456 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2025-01-10 06:00:53,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 06:00:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:53,460 INFO L225 Difference]: With dead ends: 109 [2025-01-10 06:00:53,460 INFO L226 Difference]: Without dead ends: 107 [2025-01-10 06:00:53,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:53,461 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:53,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 137 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-10 06:00:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-10 06:00:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 103 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2025-01-10 06:00:53,472 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 12 [2025-01-10 06:00:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:53,473 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2025-01-10 06:00:53,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2025-01-10 06:00:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:00:53,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:53,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:53,483 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-01-10 06:00:53,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:53,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash 114152831, now seen corresponding path program 1 times [2025-01-10 06:00:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:53,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241749131] [2025-01-10 06:00:53,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:53,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:00:53,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:00:53,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:53,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:53,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241749131] [2025-01-10 06:00:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241749131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333639068] [2025-01-10 06:00:53,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:53,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:53,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:53,861 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-01-10 06:00:53,863 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-01-10 06:00:53,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:00:54,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:00:54,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:54,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:54,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:00:54,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:54,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:00:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:54,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333639068] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:00:54,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:00:54,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:00:54,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096196423] [2025-01-10 06:00:54,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:00:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:00:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:54,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:00:54,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:00:54,136 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:00:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:54,163 INFO L93 Difference]: Finished difference Result 217 states and 281 transitions. [2025-01-10 06:00:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:00:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-01-10 06:00:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:54,165 INFO L225 Difference]: With dead ends: 217 [2025-01-10 06:00:54,165 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 06:00:54,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:00:54,166 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:54,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 398 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 06:00:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-10 06:00:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 112 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2025-01-10 06:00:54,177 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 13 [2025-01-10 06:00:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:54,177 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2025-01-10 06:00:54,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:00:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2025-01-10 06:00:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:00:54,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:54,178 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:54,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:00:54,378 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-01-10 06:00:54,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1487318229, now seen corresponding path program 2 times [2025-01-10 06:00:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355633172] [2025-01-10 06:00:54,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:00:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:54,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:00:54,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:00:54,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:00:54,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:00:54,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:54,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355633172] [2025-01-10 06:00:54,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355633172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:54,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:54,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:00:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35480545] [2025-01-10 06:00:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:54,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:00:54,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:54,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:00:54,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:54,622 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:54,671 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2025-01-10 06:00:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:00:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:00:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:54,672 INFO L225 Difference]: With dead ends: 116 [2025-01-10 06:00:54,673 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 06:00:54,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:54,673 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 121 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:54,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 376 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 06:00:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-10 06:00:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 110 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2025-01-10 06:00:54,680 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 22 [2025-01-10 06:00:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:54,681 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2025-01-10 06:00:54,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2025-01-10 06:00:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:00:54,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:54,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:54,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:00:54,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:54,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash 257692362, now seen corresponding path program 1 times [2025-01-10 06:00:54,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:54,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694460049] [2025-01-10 06:00:54,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:54,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:00:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:00:54,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:54,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:00:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:54,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694460049] [2025-01-10 06:00:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694460049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:54,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:54,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496520950] [2025-01-10 06:00:54,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:54,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:54,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:54,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:54,898 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:54,930 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2025-01-10 06:00:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:00:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:54,932 INFO L225 Difference]: With dead ends: 211 [2025-01-10 06:00:54,932 INFO L226 Difference]: Without dead ends: 117 [2025-01-10 06:00:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:54,936 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:54,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-10 06:00:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-10 06:00:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.5) internal successors, (144), 113 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2025-01-10 06:00:54,949 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 27 [2025-01-10 06:00:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:54,949 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2025-01-10 06:00:54,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2025-01-10 06:00:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:00:54,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:54,954 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:54,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:00:54,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:54,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2015821951, now seen corresponding path program 1 times [2025-01-10 06:00:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:54,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899069879] [2025-01-10 06:00:54,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:54,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:00:55,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:00:55,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:55,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899069879] [2025-01-10 06:00:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899069879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024254684] [2025-01-10 06:00:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:55,260 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-01-10 06:00:55,262 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-01-10 06:00:55,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:00:55,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:00:55,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:55,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:55,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:00:55,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:55,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:00:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:00:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024254684] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:00:55,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:00:55,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 06:00:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862443901] [2025-01-10 06:00:55,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:00:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:00:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:55,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:00:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:00:55,624 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:00:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:55,681 INFO L93 Difference]: Finished difference Result 237 states and 304 transitions. [2025-01-10 06:00:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:00:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 06:00:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:55,682 INFO L225 Difference]: With dead ends: 237 [2025-01-10 06:00:55,683 INFO L226 Difference]: Without dead ends: 135 [2025-01-10 06:00:55,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:00:55,685 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:55,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 652 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-10 06:00:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-01-10 06:00:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 131 states have internal predecessors, (162), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2025-01-10 06:00:55,697 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 30 [2025-01-10 06:00:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:55,697 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2025-01-10 06:00:55,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:00:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2025-01-10 06:00:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:00:55,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:55,698 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:55,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:00:55,898 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-01-10 06:00:55,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:55,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash 957396673, now seen corresponding path program 2 times [2025-01-10 06:00:55,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:55,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97717339] [2025-01-10 06:00:55,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:00:55,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:55,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 06:00:55,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 48 statements. [2025-01-10 06:00:55,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:00:55,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:56,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97717339] [2025-01-10 06:00:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97717339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:00:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039186776] [2025-01-10 06:00:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:56,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:56,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:56,114 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:56,128 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2025-01-10 06:00:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:00:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:56,130 INFO L225 Difference]: With dead ends: 192 [2025-01-10 06:00:56,130 INFO L226 Difference]: Without dead ends: 112 [2025-01-10 06:00:56,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:56,130 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:56,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-10 06:00:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-10 06:00:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 108 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2025-01-10 06:00:56,137 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 48 [2025-01-10 06:00:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:56,137 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2025-01-10 06:00:56,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2025-01-10 06:00:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:00:56,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:56,138 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:56,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:00:56,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:56,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:56,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1044347657, now seen corresponding path program 1 times [2025-01-10 06:00:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559338955] [2025-01-10 06:00:56,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:56,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:00:56,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:00:56,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559338955] [2025-01-10 06:00:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559338955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555704468] [2025-01-10 06:00:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:56,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:56,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:56,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:56,352 INFO L87 Difference]: Start difference. First operand 112 states and 137 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:56,369 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2025-01-10 06:00:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:00:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:56,370 INFO L225 Difference]: With dead ends: 117 [2025-01-10 06:00:56,370 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 06:00:56,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:56,371 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:56,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 06:00:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-01-10 06:00:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 111 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2025-01-10 06:00:56,376 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 48 [2025-01-10 06:00:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:56,376 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2025-01-10 06:00:56,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2025-01-10 06:00:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:00:56,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:56,381 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:56,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:00:56,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 484920095, now seen corresponding path program 1 times [2025-01-10 06:00:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:56,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690056321] [2025-01-10 06:00:56,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:56,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:00:56,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:00:56,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:56,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690056321] [2025-01-10 06:00:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690056321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344202982] [2025-01-10 06:00:56,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:56,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:56,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:56,612 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-01-10 06:00:56,616 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-01-10 06:00:56,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:00:56,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:00:56,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:56,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:56,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:00:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:56,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:00:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344202982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:00:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:00:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055141875] [2025-01-10 06:00:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:00:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:56,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:00:56,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:56,982 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:57,003 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2025-01-10 06:00:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:00:57,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:00:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:57,004 INFO L225 Difference]: With dead ends: 115 [2025-01-10 06:00:57,004 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 06:00:57,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:00:57,005 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:57,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 198 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 06:00:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-10 06:00:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 110 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2025-01-10 06:00:57,011 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 48 [2025-01-10 06:00:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:57,011 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2025-01-10 06:00:57,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2025-01-10 06:00:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:00:57,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:57,012 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:57,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:00:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:00:57,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:57,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 484920287, now seen corresponding path program 1 times [2025-01-10 06:00:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979767954] [2025-01-10 06:00:57,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:57,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:00:57,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:00:57,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:57,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:00:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979767954] [2025-01-10 06:00:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979767954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:57,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:57,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224687616] [2025-01-10 06:00:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:57,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:57,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:57,392 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:57,422 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2025-01-10 06:00:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:00:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:57,423 INFO L225 Difference]: With dead ends: 126 [2025-01-10 06:00:57,423 INFO L226 Difference]: Without dead ends: 124 [2025-01-10 06:00:57,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:57,424 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:57,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 196 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-10 06:00:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-01-10 06:00:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 119 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2025-01-10 06:00:57,430 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 48 [2025-01-10 06:00:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:57,430 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2025-01-10 06:00:57,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2025-01-10 06:00:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:00:57,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:57,431 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:00:57,432 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2147346168, now seen corresponding path program 1 times [2025-01-10 06:00:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:57,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108902605] [2025-01-10 06:00:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:57,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:00:57,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:00:57,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:57,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:00:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108902605] [2025-01-10 06:00:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108902605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:00:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749362276] [2025-01-10 06:00:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:57,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:00:57,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:57,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:00:57,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:57,650 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:57,667 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2025-01-10 06:00:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:00:57,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-10 06:00:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:57,670 INFO L225 Difference]: With dead ends: 123 [2025-01-10 06:00:57,670 INFO L226 Difference]: Without dead ends: 122 [2025-01-10 06:00:57,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:00:57,671 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:57,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-10 06:00:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-01-10 06:00:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 114 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2025-01-10 06:00:57,679 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 49 [2025-01-10 06:00:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:57,679 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2025-01-10 06:00:57,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2025-01-10 06:00:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:00:57,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:57,682 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:57,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:00:57,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:57,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 937113251, now seen corresponding path program 1 times [2025-01-10 06:00:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566206863] [2025-01-10 06:00:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:57,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:00:57,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:00:57,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:57,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566206863] [2025-01-10 06:00:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566206863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:00:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:00:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:00:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228585189] [2025-01-10 06:00:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:00:57,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:00:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:57,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:00:57,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:00:57,995 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:58,066 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2025-01-10 06:00:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:00:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:00:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:58,067 INFO L225 Difference]: With dead ends: 182 [2025-01-10 06:00:58,067 INFO L226 Difference]: Without dead ends: 118 [2025-01-10 06:00:58,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:00:58,068 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:58,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 361 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:00:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-10 06:00:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-01-10 06:00:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 107 states have (on average 1.308411214953271) internal successors, (140), 114 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2025-01-10 06:00:58,073 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 50 [2025-01-10 06:00:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:58,073 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2025-01-10 06:00:58,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2025-01-10 06:00:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:00:58,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:58,074 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:00:58,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:00:58,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:58,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1357503242, now seen corresponding path program 1 times [2025-01-10 06:00:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932620192] [2025-01-10 06:00:58,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:58,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:00:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:00:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:58,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:00:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932620192] [2025-01-10 06:00:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932620192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129109994] [2025-01-10 06:00:58,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:58,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:58,300 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-01-10 06:00:58,306 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-01-10 06:00:58,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:00:58,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:00:58,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:58,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:58,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:00:58,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:00:58,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:00:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:00:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129109994] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:00:58,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:00:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:00:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220617211] [2025-01-10 06:00:58,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:00:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:00:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:58,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:00:58,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:00:58,764 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:58,802 INFO L93 Difference]: Finished difference Result 211 states and 266 transitions. [2025-01-10 06:00:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:00:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-01-10 06:00:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:58,804 INFO L225 Difference]: With dead ends: 211 [2025-01-10 06:00:58,804 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 06:00:58,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:00:58,805 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:58,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 297 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 06:00:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-10 06:00:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 125 states have (on average 1.264) internal successors, (158), 132 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2025-01-10 06:00:58,813 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 55 [2025-01-10 06:00:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:58,813 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2025-01-10 06:00:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2025-01-10 06:00:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:00:58,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:58,814 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 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-01-10 06:00:58,828 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-01-10 06:00:59,018 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,SelfDestructingSolverStorable14 [2025-01-10 06:00:59,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:00:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:00:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1048608303, now seen corresponding path program 1 times [2025-01-10 06:00:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:00:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467773685] [2025-01-10 06:00:59,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:00:59,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:00:59,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:00:59,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:00:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467773685] [2025-01-10 06:00:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467773685] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:00:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265431362] [2025-01-10 06:00:59,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:00:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:00:59,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:59,314 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-01-10 06:00:59,317 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-01-10 06:00:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:00:59,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:00:59,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:00:59,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:00:59,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:00:59,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:00:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:59,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:00:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:00:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265431362] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:00:59,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:00:59,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 06:00:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774101696] [2025-01-10 06:00:59,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:00:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:00:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:00:59,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:00:59,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:00:59,805 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:00:59,868 INFO L93 Difference]: Finished difference Result 256 states and 317 transitions. [2025-01-10 06:00:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:00:59,869 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2025-01-10 06:00:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:00:59,870 INFO L225 Difference]: With dead ends: 256 [2025-01-10 06:00:59,870 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 06:00:59,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:00:59,871 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:00:59,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:00:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 06:00:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-01-10 06:00:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 161 states have (on average 1.204968944099379) internal successors, (194), 168 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:00:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2025-01-10 06:00:59,880 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 66 [2025-01-10 06:00:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:00:59,880 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2025-01-10 06:00:59,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:00:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2025-01-10 06:00:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 06:00:59,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:00:59,881 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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-01-10 06:00:59,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:01:00,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:00,083 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:00,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1970808463, now seen corresponding path program 2 times [2025-01-10 06:01:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:00,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308790180] [2025-01-10 06:01:00,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:00,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-01-10 06:01:00,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 84 statements. [2025-01-10 06:01:00,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:00,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308790180] [2025-01-10 06:01:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308790180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:00,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:01:00,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797529780] [2025-01-10 06:01:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:00,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:00,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:00,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:00,356 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:00,450 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2025-01-10 06:01:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-01-10 06:01:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:00,457 INFO L225 Difference]: With dead ends: 174 [2025-01-10 06:01:00,457 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 06:01:00,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:00,457 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 86 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:00,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 344 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 06:01:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-01-10 06:01:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 161 states have (on average 1.1987577639751552) internal successors, (193), 167 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2025-01-10 06:01:00,469 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 84 [2025-01-10 06:01:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:00,470 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2025-01-10 06:01:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2025-01-10 06:01:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 06:01:00,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:00,472 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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-01-10 06:01:00,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:01:00,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:00,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash 965520376, now seen corresponding path program 1 times [2025-01-10 06:01:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073902634] [2025-01-10 06:01:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:00,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:01:00,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:01:00,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:00,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:00,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073902634] [2025-01-10 06:01:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073902634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:00,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:00,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437145695] [2025-01-10 06:01:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:00,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:00,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:00,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:00,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:00,744 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:00,781 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2025-01-10 06:01:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-01-10 06:01:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:00,782 INFO L225 Difference]: With dead ends: 171 [2025-01-10 06:01:00,782 INFO L226 Difference]: Without dead ends: 170 [2025-01-10 06:01:00,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:00,783 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 81 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:00,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 186 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-10 06:01:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-10 06:01:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 161 states have (on average 1.1925465838509317) internal successors, (192), 166 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2025-01-10 06:01:00,793 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 85 [2025-01-10 06:01:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:00,794 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2025-01-10 06:01:00,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2025-01-10 06:01:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 06:01:00,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:00,794 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:00,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:01:00,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:00,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1398066520, now seen corresponding path program 1 times [2025-01-10 06:01:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521589825] [2025-01-10 06:01:00,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:01:00,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:01:00,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:00,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521589825] [2025-01-10 06:01:01,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521589825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353291834] [2025-01-10 06:01:01,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:01,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:01,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:01,009 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-01-10 06:01:01,011 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-01-10 06:01:01,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 06:01:01,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 06:01:01,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:01,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:01,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:01,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:01,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353291834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:01,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:01:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64603332] [2025-01-10 06:01:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:01,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:01,404 INFO L87 Difference]: Start difference. First operand 170 states and 196 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:01,425 INFO L93 Difference]: Finished difference Result 170 states and 196 transitions. [2025-01-10 06:01:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:01,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-01-10 06:01:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:01,426 INFO L225 Difference]: With dead ends: 170 [2025-01-10 06:01:01,426 INFO L226 Difference]: Without dead ends: 169 [2025-01-10 06:01:01,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:01,427 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:01,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 287 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-10 06:01:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-01-10 06:01:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 161 states have (on average 1.186335403726708) internal successors, (191), 165 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2025-01-10 06:01:01,440 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 85 [2025-01-10 06:01:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:01,440 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2025-01-10 06:01:01,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2025-01-10 06:01:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 06:01:01,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:01,441 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:01,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:01,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 390389491, now seen corresponding path program 1 times [2025-01-10 06:01:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095098609] [2025-01-10 06:01:01,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:01,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 06:01:01,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 06:01:01,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:01,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095098609] [2025-01-10 06:01:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095098609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716433358] [2025-01-10 06:01:01,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:01,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:01,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:01,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:01:02,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 06:01:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 06:01:02,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:02,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:02,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:02,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:02,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:01:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716433358] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:02,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:02,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:01:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704627094] [2025-01-10 06:01:02,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:02,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:02,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:02,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:02,275 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:02,307 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2025-01-10 06:01:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2025-01-10 06:01:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:02,308 INFO L225 Difference]: With dead ends: 179 [2025-01-10 06:01:02,308 INFO L226 Difference]: Without dead ends: 178 [2025-01-10 06:01:02,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:02,309 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:02,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-10 06:01:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-01-10 06:01:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 170 states have (on average 1.1764705882352942) internal successors, (200), 174 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2025-01-10 06:01:02,324 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 86 [2025-01-10 06:01:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:02,324 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2025-01-10 06:01:02,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2025-01-10 06:01:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 06:01:02,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:02,325 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:02,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:02,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:02,526 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:02,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash -247552074, now seen corresponding path program 2 times [2025-01-10 06:01:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:02,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608496287] [2025-01-10 06:01:02,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:02,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-10 06:01:02,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 95 statements. [2025-01-10 06:01:02,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-10 06:01:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608496287] [2025-01-10 06:01:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608496287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164263286] [2025-01-10 06:01:02,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:02,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:02,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:02,659 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:01:02,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-10 06:01:03,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 95 statements. [2025-01-10 06:01:03,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:03,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:03,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-10 06:01:03,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-10 06:01:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164263286] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:03,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 06:01:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803485718] [2025-01-10 06:01:03,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:03,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:03,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:03,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:03,150 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:03,190 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2025-01-10 06:01:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:03,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-01-10 06:01:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:03,191 INFO L225 Difference]: With dead ends: 178 [2025-01-10 06:01:03,191 INFO L226 Difference]: Without dead ends: 159 [2025-01-10 06:01:03,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:03,192 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:03,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-10 06:01:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-01-10 06:01:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 152 states have (on average 1.1644736842105263) internal successors, (177), 155 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2025-01-10 06:01:03,198 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 95 [2025-01-10 06:01:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:03,198 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2025-01-10 06:01:03,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2025-01-10 06:01:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 06:01:03,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:03,200 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:03,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:03,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:03,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:03,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1519143673, now seen corresponding path program 1 times [2025-01-10 06:01:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754913569] [2025-01-10 06:01:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:03,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 06:01:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 06:01:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:01:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754913569] [2025-01-10 06:01:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754913569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318079944] [2025-01-10 06:01:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:03,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:03,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:03,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:03,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:03,597 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:03,621 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2025-01-10 06:01:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2025-01-10 06:01:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:03,623 INFO L225 Difference]: With dead ends: 172 [2025-01-10 06:01:03,623 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 06:01:03,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:03,625 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:03,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 06:01:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2025-01-10 06:01:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.1666666666666667) internal successors, (189), 165 states have internal predecessors, (189), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2025-01-10 06:01:03,632 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 107 [2025-01-10 06:01:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:03,633 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2025-01-10 06:01:03,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2025-01-10 06:01:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-10 06:01:03,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:03,634 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:01:03,634 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:03,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 151186710, now seen corresponding path program 1 times [2025-01-10 06:01:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:03,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72691166] [2025-01-10 06:01:03,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:03,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-10 06:01:03,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-10 06:01:03,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:03,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-01-10 06:01:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:03,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72691166] [2025-01-10 06:01:03,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72691166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:03,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:03,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:03,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042032818] [2025-01-10 06:01:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:03,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:03,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:03,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:03,867 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:03,884 INFO L93 Difference]: Finished difference Result 172 states and 197 transitions. [2025-01-10 06:01:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2025-01-10 06:01:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:03,886 INFO L225 Difference]: With dead ends: 172 [2025-01-10 06:01:03,886 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 06:01:03,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:03,887 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:03,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 06:01:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-10 06:01:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.165644171779141) internal successors, (190), 166 states have internal predecessors, (190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2025-01-10 06:01:03,895 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 108 [2025-01-10 06:01:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2025-01-10 06:01:03,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2025-01-10 06:01:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:01:03,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:03,897 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:03,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:01:03,898 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:03,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -203427522, now seen corresponding path program 2 times [2025-01-10 06:01:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933815987] [2025-01-10 06:01:03,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:03,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-10 06:01:03,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:01:03,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:01:03,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:01:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933815987] [2025-01-10 06:01:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933815987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472863806] [2025-01-10 06:01:04,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:04,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:04,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:04,217 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:04,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:01:04,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-10 06:01:04,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:01:04,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:01:04,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:04,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:04,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:01:04,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:04,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472863806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:04,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:04,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:01:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695743031] [2025-01-10 06:01:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:04,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:04,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:04,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:04,836 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:04,870 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2025-01-10 06:01:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2025-01-10 06:01:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:04,872 INFO L225 Difference]: With dead ends: 171 [2025-01-10 06:01:04,872 INFO L226 Difference]: Without dead ends: 170 [2025-01-10 06:01:04,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:04,873 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:04,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 245 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-10 06:01:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-10 06:01:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 163 states have (on average 1.1595092024539877) internal successors, (189), 165 states have internal predecessors, (189), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2025-01-10 06:01:04,882 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 109 [2025-01-10 06:01:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2025-01-10 06:01:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2025-01-10 06:01:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:01:04,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:04,885 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:04,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:05,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 06:01:05,086 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:05,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2011285809, now seen corresponding path program 1 times [2025-01-10 06:01:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:05,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114157096] [2025-01-10 06:01:05,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:05,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:01:05,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:01:05,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:05,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:01:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114157096] [2025-01-10 06:01:05,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114157096] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141380560] [2025-01-10 06:01:05,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:05,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:05,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:01:05,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:01:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:01:05,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:05,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:05,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:05,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:01:05,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:01:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141380560] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:06,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:01:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463038468] [2025-01-10 06:01:06,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:06,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:06,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:06,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:06,027 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:06,084 INFO L93 Difference]: Finished difference Result 273 states and 306 transitions. [2025-01-10 06:01:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-01-10 06:01:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:06,086 INFO L225 Difference]: With dead ends: 273 [2025-01-10 06:01:06,086 INFO L226 Difference]: Without dead ends: 272 [2025-01-10 06:01:06,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:06,088 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:06,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-10 06:01:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-01-10 06:01:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 265 states have (on average 1.120754716981132) internal successors, (297), 267 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 303 transitions. [2025-01-10 06:01:06,102 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 303 transitions. Word has length 110 [2025-01-10 06:01:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:06,102 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 303 transitions. [2025-01-10 06:01:06,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 303 transitions. [2025-01-10 06:01:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-10 06:01:06,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:06,107 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:06,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:06,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:06,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:06,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash 808181595, now seen corresponding path program 1 times [2025-01-10 06:01:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549294332] [2025-01-10 06:01:06,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:06,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 06:01:06,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 06:01:06,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:06,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-10 06:01:06,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:06,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549294332] [2025-01-10 06:01:06,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549294332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:06,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:06,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:01:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536130303] [2025-01-10 06:01:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:06,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:06,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:06,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:06,562 INFO L87 Difference]: Start difference. First operand 272 states and 303 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:06,587 INFO L93 Difference]: Finished difference Result 308 states and 345 transitions. [2025-01-10 06:01:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:06,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 123 [2025-01-10 06:01:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:06,589 INFO L225 Difference]: With dead ends: 308 [2025-01-10 06:01:06,589 INFO L226 Difference]: Without dead ends: 282 [2025-01-10 06:01:06,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:06,590 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:06,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 353 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-10 06:01:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2025-01-10 06:01:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 267 states have (on average 1.1198501872659177) internal successors, (299), 269 states have internal predecessors, (299), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 305 transitions. [2025-01-10 06:01:06,601 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 305 transitions. Word has length 123 [2025-01-10 06:01:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:06,601 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 305 transitions. [2025-01-10 06:01:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 305 transitions. [2025-01-10 06:01:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-10 06:01:06,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:06,602 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:06,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:01:06,602 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:06,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1084294615, now seen corresponding path program 1 times [2025-01-10 06:01:06,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:06,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781282461] [2025-01-10 06:01:06,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:06,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 06:01:06,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 06:01:06,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:06,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-01-10 06:01:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:06,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781282461] [2025-01-10 06:01:06,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781282461] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332365277] [2025-01-10 06:01:06,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:06,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:06,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:01:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 06:01:07,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 06:01:07,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:07,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:07,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:01:07,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-10 06:01:07,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332365277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:07,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-10 06:01:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754218589] [2025-01-10 06:01:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:07,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:07,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:07,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:07,414 INFO L87 Difference]: Start difference. First operand 274 states and 305 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:07,440 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2025-01-10 06:01:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:07,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2025-01-10 06:01:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:07,443 INFO L225 Difference]: With dead ends: 274 [2025-01-10 06:01:07,443 INFO L226 Difference]: Without dead ends: 273 [2025-01-10 06:01:07,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:07,444 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:07,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-10 06:01:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-01-10 06:01:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 268 states have internal predecessors, (298), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 304 transitions. [2025-01-10 06:01:07,457 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 304 transitions. Word has length 123 [2025-01-10 06:01:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:07,457 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 304 transitions. [2025-01-10 06:01:07,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 304 transitions. [2025-01-10 06:01:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-10 06:01:07,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:07,459 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:07,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:07,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:07,661 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash -746604986, now seen corresponding path program 1 times [2025-01-10 06:01:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907899584] [2025-01-10 06:01:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 06:01:07,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 06:01:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-10 06:01:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907899584] [2025-01-10 06:01:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907899584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780059503] [2025-01-10 06:01:08,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:08,098 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:08,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 06:01:08,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 06:01:08,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 06:01:08,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:08,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:08,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 06:01:08,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-01-10 06:01:08,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-10 06:01:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780059503] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:08,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-10 06:01:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15452773] [2025-01-10 06:01:08,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:01:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:01:08,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:01:08,922 INFO L87 Difference]: Start difference. First operand 273 states and 304 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:09,028 INFO L93 Difference]: Finished difference Result 339 states and 390 transitions. [2025-01-10 06:01:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:01:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 124 [2025-01-10 06:01:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:09,030 INFO L225 Difference]: With dead ends: 339 [2025-01-10 06:01:09,030 INFO L226 Difference]: Without dead ends: 273 [2025-01-10 06:01:09,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:01:09,030 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 54 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:09,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 462 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-10 06:01:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-01-10 06:01:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.1123595505617978) internal successors, (297), 268 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 303 transitions. [2025-01-10 06:01:09,056 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 303 transitions. Word has length 124 [2025-01-10 06:01:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:09,056 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 303 transitions. [2025-01-10 06:01:09,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 303 transitions. [2025-01-10 06:01:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-10 06:01:09,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:09,062 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:09,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:09,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 06:01:09,262 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:09,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash 479547186, now seen corresponding path program 2 times [2025-01-10 06:01:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189558104] [2025-01-10 06:01:09,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:09,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-01-10 06:01:09,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-10 06:01:09,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:01:09,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-01-10 06:01:10,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189558104] [2025-01-10 06:01:10,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189558104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:10,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51317202] [2025-01-10 06:01:10,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:10,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:10,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 06:01:10,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-01-10 06:01:11,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-10 06:01:11,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:01:11,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:11,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 06:01:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:11,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-10 06:01:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-10 06:01:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 8 proven. 326 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-01-10 06:01:11,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:11,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-01-10 06:01:11,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 06:01:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-01-10 06:01:11,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51317202] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:11,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:11,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2025-01-10 06:01:11,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414117255] [2025-01-10 06:01:11,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:11,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:01:11,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:11,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:01:11,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:01:11,364 INFO L87 Difference]: Start difference. First operand 273 states and 303 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:11,503 INFO L93 Difference]: Finished difference Result 331 states and 379 transitions. [2025-01-10 06:01:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:01:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 158 [2025-01-10 06:01:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:11,505 INFO L225 Difference]: With dead ends: 331 [2025-01-10 06:01:11,505 INFO L226 Difference]: Without dead ends: 280 [2025-01-10 06:01:11,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:01:11,506 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:11,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 753 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-10 06:01:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2025-01-10 06:01:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 270 states have (on average 1.1111111111111112) internal successors, (300), 271 states have internal predecessors, (300), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 306 transitions. [2025-01-10 06:01:11,518 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 306 transitions. Word has length 158 [2025-01-10 06:01:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:11,518 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 306 transitions. [2025-01-10 06:01:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 306 transitions. [2025-01-10 06:01:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-10 06:01:11,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:11,520 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:11,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 06:01:11,721 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:11,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash 869313669, now seen corresponding path program 1 times [2025-01-10 06:01:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:11,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596729085] [2025-01-10 06:01:11,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-10 06:01:11,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-10 06:01:11,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:11,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:12,298 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-01-10 06:01:12,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:12,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596729085] [2025-01-10 06:01:12,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596729085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:12,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:12,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:01:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989872385] [2025-01-10 06:01:12,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:12,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:12,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:12,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:12,300 INFO L87 Difference]: Start difference. First operand 276 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:12,334 INFO L93 Difference]: Finished difference Result 331 states and 378 transitions. [2025-01-10 06:01:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 159 [2025-01-10 06:01:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:12,335 INFO L225 Difference]: With dead ends: 331 [2025-01-10 06:01:12,335 INFO L226 Difference]: Without dead ends: 276 [2025-01-10 06:01:12,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:12,336 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:12,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-10 06:01:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-10 06:01:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 271 states have internal predecessors, (299), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 305 transitions. [2025-01-10 06:01:12,347 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 305 transitions. Word has length 159 [2025-01-10 06:01:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:12,348 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 305 transitions. [2025-01-10 06:01:12,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 305 transitions. [2025-01-10 06:01:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:01:12,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:12,349 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:12,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:01:12,349 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:12,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1691260887, now seen corresponding path program 1 times [2025-01-10 06:01:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009748734] [2025-01-10 06:01:12,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:12,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:01:12,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:01:12,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:12,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:01:12,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:01:12,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:01:13,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:01:13,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:13,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:01:13,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:01:13,242 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:01:13,243 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-01-10 06:01:13,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-01-10 06:01:13,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-01-10 06:01:13,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-01-10 06:01:13,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-01-10 06:01:13,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-01-10 06:01:13,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-01-10 06:01:13,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-01-10 06:01:13,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-01-10 06:01:13,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:01:13,249 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:13,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:01:13,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:01:13 BoogieIcfgContainer [2025-01-10 06:01:13,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:01:13,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:01:13,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:01:13,343 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:01:13,344 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:00:51" (3/4) ... [2025-01-10 06:01:13,350 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:01:13,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:01:13,351 INFO L158 Benchmark]: Toolchain (without parser) took 24134.92ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 103.0MB in the beginning and 534.8MB in the end (delta: -431.8MB). Peak memory consumption was 183.1MB. Max. memory is 16.1GB. [2025-01-10 06:01:13,351 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:01:13,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.14ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 56.7MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 06:01:13,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.71ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 50.1MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:01:13,352 INFO L158 Benchmark]: Boogie Preprocessor took 140.34ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 40.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:01:13,352 INFO L158 Benchmark]: RCFGBuilder took 1013.18ms. Allocated memory is still 142.6MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 155.8kB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-01-10 06:01:13,352 INFO L158 Benchmark]: TraceAbstraction took 22257.69ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 40.2MB in the beginning and 534.9MB in the end (delta: -494.6MB). Peak memory consumption was 400.7MB. Max. memory is 16.1GB. [2025-01-10 06:01:13,352 INFO L158 Benchmark]: Witness Printer took 7.54ms. Allocated memory is still 755.0MB. Free memory was 534.9MB in the beginning and 534.8MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:01:13,353 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.14ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 56.7MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.71ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 50.1MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.34ms. Allocated memory is still 142.6MB. Free memory was 50.1MB in the beginning and 40.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1013.18ms. Allocated memory is still 142.6MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 155.8kB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22257.69ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 40.2MB in the beginning and 534.9MB in the end (delta: -494.6MB). Peak memory consumption was 400.7MB. Max. memory is 16.1GB. * Witness Printer took 7.54ms. Allocated memory is still 755.0MB. Free memory was 534.9MB in the beginning and 534.8MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 1383, overapproximation of strlen at line 1397, overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno = &bb_errno_location; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=10] [L1577] COND FALSE !(i<10) [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1584] EXPR argc+1 [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] EXPR argc+1 [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 [L1587] int i=0; VAL [applet_name={-1:0}, argc=2, argv={-14:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0, mem_track={-15:0}, optind=1] [L1587] COND TRUE i= 2u) [L1395] argv = argv + 1l [L1396] EXPR \read(**argv) [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND TRUE !(s == ((const char *)((void *)0))) [L1484] EXPR \read(*s) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1484] COND FALSE !(!((signed int)*s == 0)) [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, c=47, dummy_utmp={11:0}, optind=1, s={-27:0}] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={-27:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={-27:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] m=strlen(s) [L1398] argv = argv + 1l [L1399] signed int tmp_statement_expression$6; [L1400] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1400] COND FALSE !(!(*argv == ((char *)((void *)0)))) [L1414] unsigned long int tmp_post$8 = m; [L1415] m = m + 1ul [L1416] s[(signed long int)tmp_post$8] = (char)10 [L1417] signed long int return_value_full_write$9; [L1418] CALL full_write(1, (const void *)s, m) [L1464] signed long int cc; [L1465] signed long int total = (signed long int)0; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, dummy_utmp={11:0}, fd=1, len=-9223372036854775808, optind=1, total=0] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=-9223372036854775808, dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=-9223372036854775808, optind=1, ret=2] [L1571] return ret; VAL [\result=2, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=-9223372036854775808, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=-9223372036854775808, dummy_utmp={11:0}, fd=1, n=2, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=-9223372036854775808, dummy_utmp={11:0}, fd=1, n=2, optind=1] [L1510] return n; VAL [\result=2, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=-9223372036854775808, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, cc=2, dummy_utmp={11:0}, fd=1, len=-9223372036854775808, optind=1, total=0] [L1475] EXPR total + cc [L1475] total = total + cc [L1476] buf = (const void *)((const char *)buf + cc) [L1466] len = len - (unsigned long int)cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, dummy_utmp={11:0}, fd=1, len=-(((__int128) 0 << 64) | 9223372036854775810U), optind=1, total=2] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=-(((__int128) 0 << 64) | 9223372036854775810U), dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=-(((__int128) 0 << 64) | 9223372036854775810U), optind=1, ret=9223372036854775806] [L1571] return ret; VAL [\result=9223372036854775806, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=-(((__int128) 0 << 64) | 9223372036854775810U), optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=-(((__int128) 0 << 64) | 9223372036854775810U), dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=-(((__int128) 0 << 64) | 9223372036854775810U), dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1] [L1510] return n; VAL [\result=9223372036854775806, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=-(((__int128) 0 << 64) | 9223372036854775810U), dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, cc=9223372036854775806, dummy_utmp={11:0}, fd=1, len=-(((__int128) 0 << 64) | 9223372036854775810U), optind=1, total=2] [L1475] total + cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, dummy_utmp={11:0}, fd=1, len=-(((__int128) 0 << 64) | 9223372036854775810U), optind=1] - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 31, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 697 mSDsluCounter, 9091 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5993 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 807 IncrementalHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 3098 mSDtfsCounter, 807 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1956 GetRequests, 1834 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=29, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 3377 NumberOfCodeBlocks, 3119 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 3895 ConstructedInterpolants, 0 QuantifiedInterpolants, 8263 SizeOfPredicates, 13 NumberOfNonLiveVariables, 20039 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 54 InterpolantComputations, 21 PerfectInterpolantSequences, 12072/14537 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-10 06:01:13,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:01:15,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:01:15,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-01-10 06:01:15,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:01:15,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:01:15,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-01-10 06:01:15,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:01:15,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:01:15,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:01:15,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:01:15,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:01:15,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:01:15,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:01:15,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:01:15,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:01:15,920 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:01:15,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:01:15,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:01:15,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:01:15,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:01:15,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:01:15,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:01:15,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:01:15,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:01:15,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:01:15,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:01:15,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:01:15,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:01:15,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:01:15,923 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 06:01:15,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 06:01:15,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:01:15,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:01:15,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:01:15,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:01:15,924 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-01-10 06:01:16,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:01:16,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:01:16,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:01:16,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:01:16,232 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:01:16,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-01-10 06:01:17,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/385fb6783/fbef59e9a6c34e868126bf716bc564ae/FLAGf4654beb9 [2025-01-10 06:01:17,925 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:01:17,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-01-10 06:01:17,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/385fb6783/fbef59e9a6c34e868126bf716bc564ae/FLAGf4654beb9 [2025-01-10 06:01:18,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/385fb6783/fbef59e9a6c34e868126bf716bc564ae [2025-01-10 06:01:18,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:01:18,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:01:18,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:01:18,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:01:18,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:01:18,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:01:18" (1/1) ... [2025-01-10 06:01:18,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b4e8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:18, skipping insertion in model container [2025-01-10 06:01:18,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:01:18" (1/1) ... [2025-01-10 06:01:18,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:01:18,778 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,795 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,802 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,804 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,814 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,814 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,815 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,817 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,819 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,832 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:01:18,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:01:18,866 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:01:18,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:01:19,106 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:01:19,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19 WrapperNode [2025-01-10 06:01:19,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:01:19,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:01:19,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:01:19,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:01:19,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,196 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 717 [2025-01-10 06:01:19,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:01:19,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:01:19,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:01:19,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:01:19,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,263 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 12, 3, 2, 3, 12, 3, 4, 4, 4, 2, 3, 3, 355]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 3, 0, 3, 0, 3, 3, 3, 3, 0, 3, 1, 355]. The 11 writes are split as follows [0, 5, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 1, 0]. [2025-01-10 06:01:19,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:01:19,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:01:19,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:01:19,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:01:19,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (1/1) ... [2025-01-10 06:01:19,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:01:19,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:19,422 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-01-10 06:01:19,431 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-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-10 06:01:19,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:01:19,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:01:19,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-10 06:01:19,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-10 06:01:19,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-10 06:01:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:01:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:01:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 06:01:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:01:19,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:01:19,826 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:01:19,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:01:20,697 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-01-10 06:01:20,698 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:01:20,712 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:01:20,713 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:01:20,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:20 BoogieIcfgContainer [2025-01-10 06:01:20,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:01:20,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:01:20,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:01:20,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:01:20,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:01:18" (1/3) ... [2025-01-10 06:01:20,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531506a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:20, skipping insertion in model container [2025-01-10 06:01:20,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:19" (2/3) ... [2025-01-10 06:01:20,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531506a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:20, skipping insertion in model container [2025-01-10 06:01:20,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:20" (3/3) ... [2025-01-10 06:01:20,730 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-01-10 06:01:20,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:01:20,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 115 locations, 1 initial locations, 7 loop locations, and 24 error locations. [2025-01-10 06:01:20,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:01:20,809 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;@3d749c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:01:20,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-10 06:01:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 87 states have (on average 1.7126436781609196) internal successors, (149), 111 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:01:20,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:20,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:01:20,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:20,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1171908, now seen corresponding path program 1 times [2025-01-10 06:01:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678611377] [2025-01-10 06:01:20,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:20,851 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-01-10 06:01:20,853 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-01-10 06:01:21,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:01:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:01:21,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:21,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:21,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 06:01:21,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:21,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:21,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678611377] [2025-01-10 06:01:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678611377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:21,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:01:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950259277] [2025-01-10 06:01:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:01:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:21,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:01:21,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:01:21,639 INFO L87 Difference]: Start difference. First operand has 115 states, 87 states have (on average 1.7126436781609196) internal successors, (149), 111 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-01-10 06:01:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:21,659 INFO L93 Difference]: Finished difference Result 208 states and 297 transitions. [2025-01-10 06:01:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:01:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-01-10 06:01:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:21,666 INFO L225 Difference]: With dead ends: 208 [2025-01-10 06:01:21,667 INFO L226 Difference]: Without dead ends: 96 [2025-01-10 06:01:21,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:01:21,672 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:21,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-10 06:01:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-10 06:01:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 92 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2025-01-10 06:01:21,707 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 4 [2025-01-10 06:01:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:21,708 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2025-01-10 06:01:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-01-10 06:01:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2025-01-10 06:01:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:01:21,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:21,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:01:21,744 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-01-10 06:01:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:21,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash 36329196, now seen corresponding path program 1 times [2025-01-10 06:01:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972798642] [2025-01-10 06:01:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:21,916 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-01-10 06:01:21,921 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-01-10 06:01:22,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:01:22,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:01:22,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:22,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:22,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:22,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:22,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:22,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:22,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972798642] [2025-01-10 06:01:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972798642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:22,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954526787] [2025-01-10 06:01:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:22,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:22,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:22,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:22,643 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 06:01:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:22,695 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2025-01-10 06:01:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-01-10 06:01:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:22,697 INFO L225 Difference]: With dead ends: 190 [2025-01-10 06:01:22,698 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 06:01:22,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:22,700 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:22,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 06:01:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-10 06:01:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 95 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2025-01-10 06:01:22,713 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 5 [2025-01-10 06:01:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:22,713 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2025-01-10 06:01:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 06:01:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2025-01-10 06:01:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:01:22,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:22,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:01:22,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:01:22,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:22,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -48636798, now seen corresponding path program 1 times [2025-01-10 06:01:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491660090] [2025-01-10 06:01:22,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:22,922 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-01-10 06:01:22,924 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-01-10 06:01:23,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:01:23,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:01:23,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:23,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:23,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:23,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:23,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:23,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491660090] [2025-01-10 06:01:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491660090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:23,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:01:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816926316] [2025-01-10 06:01:23,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:23,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:23,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:23,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:23,642 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-01-10 06:01:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:23,708 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2025-01-10 06:01:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:23,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 8 [2025-01-10 06:01:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:23,710 INFO L225 Difference]: With dead ends: 193 [2025-01-10 06:01:23,710 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 06:01:23,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:23,711 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:23,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 06:01:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-01-10 06:01:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 95 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2025-01-10 06:01:23,725 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 8 [2025-01-10 06:01:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:23,725 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2025-01-10 06:01:23,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-01-10 06:01:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2025-01-10 06:01:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 06:01:23,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:23,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:23,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:23,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:23,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:23,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 276915477, now seen corresponding path program 1 times [2025-01-10 06:01:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042928209] [2025-01-10 06:01:23,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:23,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:23,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:23,933 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-01-10 06:01:23,934 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-01-10 06:01:24,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:01:24,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:01:24,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:24,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:24,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:01:24,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:01:24,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:24,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:24,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042928209] [2025-01-10 06:01:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042928209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722171094] [2025-01-10 06:01:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:24,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:24,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:24,610 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:24,911 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2025-01-10 06:01:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:24,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 06:01:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:24,913 INFO L225 Difference]: With dead ends: 99 [2025-01-10 06:01:24,913 INFO L226 Difference]: Without dead ends: 97 [2025-01-10 06:01:24,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:24,914 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 110 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:24,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 343 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:01:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-10 06:01:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-10 06:01:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 93 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-01-10 06:01:24,918 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 16 [2025-01-10 06:01:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:24,919 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-01-10 06:01:24,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-01-10 06:01:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:01:24,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:24,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:24,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:01:25,120 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 [2025-01-10 06:01:25,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:25,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2091241213, now seen corresponding path program 1 times [2025-01-10 06:01:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257856792] [2025-01-10 06:01:25,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:25,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:25,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:25,124 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-01-10 06:01:25,125 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-01-10 06:01:25,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:01:25,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:01:25,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:25,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:25,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:25,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:01:25,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:25,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257856792] [2025-01-10 06:01:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257856792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:25,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455196039] [2025-01-10 06:01:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:25,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:25,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:25,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:25,791 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:25,827 INFO L93 Difference]: Finished difference Result 183 states and 245 transitions. [2025-01-10 06:01:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:01:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:25,829 INFO L225 Difference]: With dead ends: 183 [2025-01-10 06:01:25,829 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 06:01:25,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:25,830 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:25,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 06:01:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-10 06:01:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 96 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2025-01-10 06:01:25,839 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 22 [2025-01-10 06:01:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:25,839 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2025-01-10 06:01:25,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2025-01-10 06:01:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 06:01:25,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:25,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:25,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:01:26,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:26,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1828800098, now seen corresponding path program 1 times [2025-01-10 06:01:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034784246] [2025-01-10 06:01:26,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:26,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:26,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:26,046 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-01-10 06:01:26,050 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-01-10 06:01:26,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:01:26,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:01:26,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:26,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:26,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:26,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:01:26,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:26,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034784246] [2025-01-10 06:01:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034784246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067273662] [2025-01-10 06:01:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:26,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:26,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:26,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:26,729 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:26,761 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2025-01-10 06:01:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 06:01:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:26,762 INFO L225 Difference]: With dead ends: 104 [2025-01-10 06:01:26,762 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 06:01:26,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:26,763 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:26,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 06:01:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-10 06:01:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 99 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2025-01-10 06:01:26,773 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 25 [2025-01-10 06:01:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:26,773 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-01-10 06:01:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2025-01-10 06:01:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 06:01:26,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:26,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:26,810 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-01-10 06:01:26,974 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 [2025-01-10 06:01:26,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:26,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1666414600, now seen corresponding path program 1 times [2025-01-10 06:01:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594292609] [2025-01-10 06:01:26,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:26,978 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-01-10 06:01:26,979 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-01-10 06:01:27,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:01:27,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:01:27,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:27,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:27,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:27,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:01:27,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:01:27,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:27,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594292609] [2025-01-10 06:01:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594292609] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:27,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:01:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964277997] [2025-01-10 06:01:27,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:27,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:27,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:27,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:27,966 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:28,139 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2025-01-10 06:01:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 06:01:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:28,142 INFO L225 Difference]: With dead ends: 195 [2025-01-10 06:01:28,142 INFO L226 Difference]: Without dead ends: 106 [2025-01-10 06:01:28,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:28,143 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:28,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-10 06:01:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-01-10 06:01:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 99 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2025-01-10 06:01:28,149 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 25 [2025-01-10 06:01:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:28,149 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-01-10 06:01:28,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2025-01-10 06:01:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 06:01:28,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:28,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:28,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:01:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:28,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:28,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1095387229, now seen corresponding path program 1 times [2025-01-10 06:01:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:28,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111713182] [2025-01-10 06:01:28,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:28,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:28,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:28,354 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-01-10 06:01:28,355 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-01-10 06:01:28,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:01:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:01:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:29,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:01:29,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:01:29,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:29,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111713182] [2025-01-10 06:01:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111713182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:29,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:29,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:01:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169948819] [2025-01-10 06:01:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:29,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:29,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:29,107 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:29,435 INFO L93 Difference]: Finished difference Result 192 states and 252 transitions. [2025-01-10 06:01:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:29,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-10 06:01:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:29,436 INFO L225 Difference]: With dead ends: 192 [2025-01-10 06:01:29,436 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 06:01:29,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:29,437 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 119 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:29,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 430 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:01:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 06:01:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-10 06:01:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 109 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2025-01-10 06:01:29,443 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 26 [2025-01-10 06:01:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:29,443 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2025-01-10 06:01:29,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2025-01-10 06:01:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 06:01:29,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:29,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:29,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:01:29,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:29,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:29,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 389764879, now seen corresponding path program 1 times [2025-01-10 06:01:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:29,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541397280] [2025-01-10 06:01:29,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:29,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:29,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:29,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:01:29,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:01:30,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:01:30,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:30,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:30,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:01:30,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:01:30,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:01:30,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541397280] [2025-01-10 06:01:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541397280] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 06:01:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292302002] [2025-01-10 06:01:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:30,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:30,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:30,566 INFO L87 Difference]: Start difference. First operand 113 states and 145 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:30,752 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2025-01-10 06:01:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-01-10 06:01:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:30,754 INFO L225 Difference]: With dead ends: 115 [2025-01-10 06:01:30,754 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 06:01:30,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:30,755 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 127 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:30,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 211 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:01:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 06:01:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-01-10 06:01:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 108 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2025-01-10 06:01:30,775 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 36 [2025-01-10 06:01:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:30,775 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2025-01-10 06:01:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2025-01-10 06:01:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 06:01:30,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:30,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:30,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:01:30,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:30,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:30,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1425928051, now seen corresponding path program 1 times [2025-01-10 06:01:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:30,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8314220] [2025-01-10 06:01:30,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:30,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:30,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:30,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:30,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:01:31,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:01:31,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:01:31,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:31,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:31,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 06:01:31,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 06:01:31,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:31,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8314220] [2025-01-10 06:01:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8314220] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:31,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:01:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667848700] [2025-01-10 06:01:31,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:31,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:31,829 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:31,878 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2025-01-10 06:01:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-01-10 06:01:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:31,880 INFO L225 Difference]: With dead ends: 119 [2025-01-10 06:01:31,880 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 06:01:31,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:31,880 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:31,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 06:01:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-10 06:01:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 98 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2025-01-10 06:01:31,885 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 38 [2025-01-10 06:01:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:31,885 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2025-01-10 06:01:31,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2025-01-10 06:01:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 06:01:31,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:31,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:31,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:01:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:32,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash -67519793, now seen corresponding path program 1 times [2025-01-10 06:01:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896163089] [2025-01-10 06:01:32,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:32,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:32,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:01:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:01:32,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:01:32,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:32,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:32,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:32,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:01:32,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:01:32,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896163089] [2025-01-10 06:01:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896163089] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:32,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:01:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016669930] [2025-01-10 06:01:32,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:01:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:32,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:01:32,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:01:32,990 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:33,419 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2025-01-10 06:01:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-01-10 06:01:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:33,422 INFO L225 Difference]: With dead ends: 123 [2025-01-10 06:01:33,422 INFO L226 Difference]: Without dead ends: 122 [2025-01-10 06:01:33,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:33,422 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:33,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:01:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-10 06:01:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2025-01-10 06:01:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 88 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2025-01-10 06:01:33,428 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 38 [2025-01-10 06:01:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2025-01-10 06:01:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2025-01-10 06:01:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 06:01:33,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:33,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:33,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 06:01:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:33,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1164770779, now seen corresponding path program 1 times [2025-01-10 06:01:33,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547656216] [2025-01-10 06:01:33,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:33,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:33,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:01:33,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:01:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:01:34,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:34,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:34,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:34,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 06:01:34,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:34,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547656216] [2025-01-10 06:01:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547656216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682868084] [2025-01-10 06:01:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:34,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:34,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:34,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:34,375 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:34,394 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2025-01-10 06:01:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-01-10 06:01:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:34,396 INFO L225 Difference]: With dead ends: 139 [2025-01-10 06:01:34,396 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 06:01:34,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:34,398 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:34,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 06:01:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-10 06:01:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 72 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2025-01-10 06:01:34,405 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 39 [2025-01-10 06:01:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:34,405 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2025-01-10 06:01:34,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2025-01-10 06:01:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 06:01:34,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:34,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:01:34,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 06:01:34,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:34,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:34,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash 65139847, now seen corresponding path program 1 times [2025-01-10 06:01:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:34,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590694466] [2025-01-10 06:01:34,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:34,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:34,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:34,614 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:34,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:01:34,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 06:01:35,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 06:01:35,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:35,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:35,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:01:35,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:01:35,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:35,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590694466] [2025-01-10 06:01:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590694466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:35,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:01:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837319073] [2025-01-10 06:01:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:35,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:35,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:35,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:35,406 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:35,460 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2025-01-10 06:01:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-01-10 06:01:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:35,461 INFO L225 Difference]: With dead ends: 102 [2025-01-10 06:01:35,461 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 06:01:35,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:35,462 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:35,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 349 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 06:01:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-01-10 06:01:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2025-01-10 06:01:35,469 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 59 [2025-01-10 06:01:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:35,470 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-01-10 06:01:35,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2025-01-10 06:01:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 06:01:35,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:35,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:01:35,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 06:01:35,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:35,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 122398149, now seen corresponding path program 1 times [2025-01-10 06:01:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064384498] [2025-01-10 06:01:35,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:35,675 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:35,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 06:01:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 06:01:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 06:01:36,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:36,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:36,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:36,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:01:36,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:36,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064384498] [2025-01-10 06:01:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064384498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:01:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519895965] [2025-01-10 06:01:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:36,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:36,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:36,488 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:36,523 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2025-01-10 06:01:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-01-10 06:01:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:36,524 INFO L225 Difference]: With dead ends: 92 [2025-01-10 06:01:36,524 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 06:01:36,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:01:36,525 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:36,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 249 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 06:01:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 06:01:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2025-01-10 06:01:36,530 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 59 [2025-01-10 06:01:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:36,530 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-01-10 06:01:36,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:01:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2025-01-10 06:01:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 06:01:36,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:36,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:36,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 06:01:36,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:36,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 631260503, now seen corresponding path program 1 times [2025-01-10 06:01:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840897261] [2025-01-10 06:01:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:36,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:36,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:36,735 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:36,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 06:01:36,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 06:01:37,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 06:01:37,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:37,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:37,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:01:37,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 06:01:37,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 06:01:37,824 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840897261] [2025-01-10 06:01:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840897261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:37,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-10 06:01:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795929221] [2025-01-10 06:01:37,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:37,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:01:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:37,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:01:37,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:37,825 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:38,360 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2025-01-10 06:01:38,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:38,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 75 [2025-01-10 06:01:38,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:38,362 INFO L225 Difference]: With dead ends: 176 [2025-01-10 06:01:38,362 INFO L226 Difference]: Without dead ends: 109 [2025-01-10 06:01:38,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:38,364 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 25 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:38,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 408 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:01:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-10 06:01:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2025-01-10 06:01:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 95 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2025-01-10 06:01:38,370 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 75 [2025-01-10 06:01:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:38,370 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2025-01-10 06:01:38,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2025-01-10 06:01:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 06:01:38,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:38,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:38,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 06:01:38,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:38,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:38,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1836751723, now seen corresponding path program 2 times [2025-01-10 06:01:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005930400] [2025-01-10 06:01:38,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:38,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:38,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:38,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 06:01:38,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-01-10 06:01:39,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 85 statements. [2025-01-10 06:01:39,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:39,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:39,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:39,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-10 06:01:39,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:39,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:39,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005930400] [2025-01-10 06:01:39,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005930400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:39,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:39,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212360139] [2025-01-10 06:01:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:39,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:39,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:39,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:39,303 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:39,324 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2025-01-10 06:01:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-01-10 06:01:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:39,325 INFO L225 Difference]: With dead ends: 100 [2025-01-10 06:01:39,325 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 06:01:39,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:39,326 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:39,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 06:01:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-10 06:01:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-01-10 06:01:39,331 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 85 [2025-01-10 06:01:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:39,331 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-01-10 06:01:39,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-01-10 06:01:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 06:01:39,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:39,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:39,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 06:01:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:39,533 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1104728882, now seen corresponding path program 1 times [2025-01-10 06:01:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163548585] [2025-01-10 06:01:39,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:39,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:39,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:39,537 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:39,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 06:01:39,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 06:01:40,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 06:01:40,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:40,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:40,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:01:40,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:40,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2025-01-10 06:01:40,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:01:40,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:01:40,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 06:01:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 06:01:40,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:40,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-01-10 06:01:40,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-10 06:01:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 06:01:40,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163548585] [2025-01-10 06:01:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163548585] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:40,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:40,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2025-01-10 06:01:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498919541] [2025-01-10 06:01:40,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:40,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:01:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:40,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:01:40,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:01:40,573 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:41,748 INFO L93 Difference]: Finished difference Result 163 states and 207 transitions. [2025-01-10 06:01:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:01:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 86 [2025-01-10 06:01:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:41,750 INFO L225 Difference]: With dead ends: 163 [2025-01-10 06:01:41,750 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 06:01:41,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:01:41,750 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:41,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 630 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 06:01:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 06:01:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2025-01-10 06:01:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-01-10 06:01:41,756 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 86 [2025-01-10 06:01:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-01-10 06:01:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-01-10 06:01:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 06:01:41,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:41,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:41,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 06:01:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:41,957 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1561053792, now seen corresponding path program 1 times [2025-01-10 06:01:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298542519] [2025-01-10 06:01:41,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:41,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:41,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:41,961 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:41,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 06:01:42,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 06:01:42,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 06:01:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:42,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 06:01:42,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:42,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2025-01-10 06:01:42,896 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:01:42,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:01:42,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 06:01:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 06:01:42,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:43,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-01-10 06:01:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-01-10 06:01:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-10 06:01:43,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:43,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298542519] [2025-01-10 06:01:43,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298542519] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:43,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:43,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2025-01-10 06:01:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553991463] [2025-01-10 06:01:43,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:43,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:01:43,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:43,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:01:43,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:01:43,098 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:44,666 INFO L93 Difference]: Finished difference Result 166 states and 209 transitions. [2025-01-10 06:01:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:01:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2025-01-10 06:01:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:44,668 INFO L225 Difference]: With dead ends: 166 [2025-01-10 06:01:44,668 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 06:01:44,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:01:44,669 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:44,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 589 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-10 06:01:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 06:01:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2025-01-10 06:01:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 97 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-01-10 06:01:44,675 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 92 [2025-01-10 06:01:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-01-10 06:01:44,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-01-10 06:01:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 06:01:44,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:44,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:44,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 06:01:44,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:44,877 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:44,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2035192791, now seen corresponding path program 1 times [2025-01-10 06:01:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:44,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138639635] [2025-01-10 06:01:44,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:44,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:44,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:44,880 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:44,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 06:01:45,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 06:01:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 06:01:45,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:45,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:45,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:01:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-10 06:01:45,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-10 06:01:45,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138639635] [2025-01-10 06:01:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138639635] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:45,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-10 06:01:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335278436] [2025-01-10 06:01:45,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:01:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:45,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:01:45,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:45,707 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:01:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:45,802 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2025-01-10 06:01:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:01:45,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2025-01-10 06:01:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:45,805 INFO L225 Difference]: With dead ends: 207 [2025-01-10 06:01:45,805 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 06:01:45,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:01:45,805 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:45,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 326 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 06:01:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-10 06:01:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 109 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2025-01-10 06:01:45,811 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 93 [2025-01-10 06:01:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:45,811 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2025-01-10 06:01:45,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:01:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2025-01-10 06:01:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:01:45,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:45,812 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:45,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 06:01:46,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:46,012 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:46,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1247282263, now seen corresponding path program 2 times [2025-01-10 06:01:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866988252] [2025-01-10 06:01:46,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:46,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:46,015 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:46,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 06:01:46,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-01-10 06:01:46,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:01:46,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:01:46,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:46,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:01:46,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-10 06:01:47,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-10 06:01:47,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:01:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866988252] [2025-01-10 06:01:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866988252] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:47,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:01:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-10 06:01:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351777021] [2025-01-10 06:01:47,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:47,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:01:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:01:47,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:01:47,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:01:47,048 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:47,242 INFO L93 Difference]: Finished difference Result 218 states and 271 transitions. [2025-01-10 06:01:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:01:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2025-01-10 06:01:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:47,243 INFO L225 Difference]: With dead ends: 218 [2025-01-10 06:01:47,243 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 06:01:47,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:01:47,244 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:47,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 323 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:01:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 06:01:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-10 06:01:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.1729323308270676) internal successors, (156), 133 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:01:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2025-01-10 06:01:47,251 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 105 [2025-01-10 06:01:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2025-01-10 06:01:47,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:01:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2025-01-10 06:01:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-10 06:01:47,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:47,252 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:47,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 06:01:47,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:47,453 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-01-10 06:01:47,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1933888041, now seen corresponding path program 3 times [2025-01-10 06:01:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:01:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756399232] [2025-01-10 06:01:47,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:01:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:47,456 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:47,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 06:01:47,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 129 statements into 16 equivalence classes.