./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_compareModified_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/standard_compareModified_ground.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:48:30,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:48:30,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:48:30,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:48:30,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:48:30,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:48:30,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:48:30,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:48:30,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:48:30,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:48:30,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:48:30,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:48:30,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:48:30,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:48:30,252 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:48:30,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:48:30,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:48:30,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:48:30,254 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:48:30,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:48:30,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:48:30,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:48:30,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:48:30,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:48:30,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:48:30,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:48:30,255 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec4d4b5cea975144b4de3d9f9eb9b04d1c4b7aa6b7464f360f53530c4a9bd50e [2025-02-08 08:48:30,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:48:30,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:48:30,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:48:30,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:48:30,489 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:48:30,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2025-02-08 08:48:31,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62f1fbf46/cfa2858e3c1c4bf2a33396aef38b3134/FLAG433e2682e [2025-02-08 08:48:31,910 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:48:31,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_compareModified_ground.i [2025-02-08 08:48:31,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62f1fbf46/cfa2858e3c1c4bf2a33396aef38b3134/FLAG433e2682e [2025-02-08 08:48:31,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62f1fbf46/cfa2858e3c1c4bf2a33396aef38b3134 [2025-02-08 08:48:31,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:48:31,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:48:31,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:48:31,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:48:31,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:48:31,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:48:31" (1/1) ... [2025-02-08 08:48:31,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234db724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:31, skipping insertion in model container [2025-02-08 08:48:31,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:48:31" (1/1) ... [2025-02-08 08:48:31,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:48:32,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:48:32,068 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:48:32,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:48:32,096 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:48:32,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32 WrapperNode [2025-02-08 08:48:32,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:48:32,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:48:32,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:48:32,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:48:32,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,124 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-02-08 08:48:32,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:48:32,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:48:32,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:48:32,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:48:32,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,146 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 2, 5, 3]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-02-08 08:48:32,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:48:32,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:48:32,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:48:32,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:48:32,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (1/1) ... [2025-02-08 08:48:32,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:48:32,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:32,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:48:32,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:48:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:48:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:48:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:48:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:48:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:48:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 08:48:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 08:48:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:48:32,246 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:48:32,247 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:48:32,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-02-08 08:48:32,430 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-08 08:48:32,430 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:48:32,438 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:48:32,438 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:48:32,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:48:32 BoogieIcfgContainer [2025-02-08 08:48:32,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:48:32,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:48:32,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:48:32,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:48:32,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:48:31" (1/3) ... [2025-02-08 08:48:32,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703133a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:48:32, skipping insertion in model container [2025-02-08 08:48:32,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:48:32" (2/3) ... [2025-02-08 08:48:32,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703133a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:48:32, skipping insertion in model container [2025-02-08 08:48:32,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:48:32" (3/3) ... [2025-02-08 08:48:32,447 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_compareModified_ground.i [2025-02-08 08:48:32,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:48:32,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_compareModified_ground.i that has 2 procedures, 38 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-02-08 08:48:32,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:48:32,509 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;@3cd06f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:48:32,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 08:48:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 34 states have internal predecessors, (42), 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-02-08 08:48:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 08:48:32,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:32,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 08:48:32,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash 66499, now seen corresponding path program 1 times [2025-02-08 08:48:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:32,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799680054] [2025-02-08 08:48:32,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:48:32,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:48:32,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:32,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799680054] [2025-02-08 08:48:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799680054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:48:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123922723] [2025-02-08 08:48:32,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:32,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:32,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:32,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:32,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:32,745 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 34 states have internal predecessors, (42), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:32,792 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-02-08 08:48:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-08 08:48:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:32,797 INFO L225 Difference]: With dead ends: 61 [2025-02-08 08:48:32,797 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 08:48:32,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:32,802 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:32,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 08:48:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 08:48:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 28 states have internal predecessors, (34), 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-02-08 08:48:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-08 08:48:32,833 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 3 [2025-02-08 08:48:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-08 08:48:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-08 08:48:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:48:32,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:32,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:48:32,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:48:32,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2061471, now seen corresponding path program 1 times [2025-02-08 08:48:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353777838] [2025-02-08 08:48:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:48:32,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:48:32,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353777838] [2025-02-08 08:48:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353777838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:48:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173939453] [2025-02-08 08:48:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:32,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:32,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:32,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:32,918 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) 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-02-08 08:48:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:32,948 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-02-08 08:48:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-02-08 08:48:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:32,949 INFO L225 Difference]: With dead ends: 63 [2025-02-08 08:48:32,949 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 08:48:32,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:32,951 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 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-02-08 08:48:32,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 08:48:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 08:48:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.48) internal successors, (37), 31 states have internal predecessors, (37), 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-02-08 08:48:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-08 08:48:32,956 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 4 [2025-02-08 08:48:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:32,957 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-08 08:48:32,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) 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-02-08 08:48:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-08 08:48:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:48:32,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:32,957 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 08:48:32,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:48:32,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:32,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1283746309, now seen corresponding path program 1 times [2025-02-08 08:48:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207686231] [2025-02-08 08:48:32,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:32,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:32,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:48:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:48:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207686231] [2025-02-08 08:48:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207686231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:48:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919087577] [2025-02-08 08:48:33,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:33,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:33,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:33,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:48:33,045 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-02-08 08:48:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:33,057 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-02-08 08:48:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-02-08 08:48:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:33,058 INFO L225 Difference]: With dead ends: 35 [2025-02-08 08:48:33,058 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 08:48:33,058 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-02-08 08:48:33,059 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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-02-08 08:48:33,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 08:48:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-08 08:48:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 28 states have internal predecessors, (34), 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-02-08 08:48:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-02-08 08:48:33,065 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-02-08 08:48:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:33,065 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-02-08 08:48:33,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-02-08 08:48:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-02-08 08:48:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 08:48:33,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:33,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:33,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:48:33,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1019848286, now seen corresponding path program 1 times [2025-02-08 08:48:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811977693] [2025-02-08 08:48:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:33,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:48:33,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:48:33,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:33,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811977693] [2025-02-08 08:48:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811977693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:33,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:48:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716626470] [2025-02-08 08:48:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:33,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:33,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:33,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:48:33,138 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:33,151 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-02-08 08:48:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-02-08 08:48:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:33,152 INFO L225 Difference]: With dead ends: 32 [2025-02-08 08:48:33,152 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 08:48:33,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-08 08:48:33,152 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 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-02-08 08:48:33,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 08:48:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 08:48:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 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-02-08 08:48:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-08 08:48:33,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 9 [2025-02-08 08:48:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:33,157 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-08 08:48:33,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-08 08:48:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 08:48:33,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:33,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:33,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:48:33,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1550525787, now seen corresponding path program 1 times [2025-02-08 08:48:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813671177] [2025-02-08 08:48:33,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:33,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:48:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:48:33,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:33,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:48:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813671177] [2025-02-08 08:48:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813671177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892467426] [2025-02-08 08:48:33,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:33,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:33,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:33,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:33,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:48:33,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:48:33,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:48:33,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:33,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:33,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:48:33,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:33,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:48:33,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892467426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:33,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:48:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-08 08:48:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752562183] [2025-02-08 08:48:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:33,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:33,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:33,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:48:33,365 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:33,392 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-02-08 08:48:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2025-02-08 08:48:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:33,393 INFO L225 Difference]: With dead ends: 57 [2025-02-08 08:48:33,393 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 08:48:33,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:48:33,396 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:33,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 08:48:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 08:48:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 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-02-08 08:48:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-08 08:48:33,404 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 10 [2025-02-08 08:48:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:33,404 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-08 08:48:33,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:48:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-02-08 08:48:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:48:33,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:33,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:33,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:48:33,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:33,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:33,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1829504738, now seen corresponding path program 1 times [2025-02-08 08:48:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135610338] [2025-02-08 08:48:33,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:33,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:48:33,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:48:33,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:33,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 08:48:33,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:33,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135610338] [2025-02-08 08:48:33,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135610338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:33,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399642183] [2025-02-08 08:48:33,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:33,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:33,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:33,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:33,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:48:33,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:48:33,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:48:33,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:33,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:48:33,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:48:33,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:48:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399642183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:33,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:48:33,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-02-08 08:48:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28961353] [2025-02-08 08:48:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:33,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:33,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:33,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:48:33,754 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-08 08:48:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:33,765 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-02-08 08:48:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:33,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 15 [2025-02-08 08:48:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:33,767 INFO L225 Difference]: With dead ends: 36 [2025-02-08 08:48:33,767 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 08:48:33,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:48:33,767 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 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-02-08 08:48:33,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 08:48:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-02-08 08:48:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.375) internal successors, (33), 27 states have internal predecessors, (33), 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-02-08 08:48:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-08 08:48:33,770 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 15 [2025-02-08 08:48:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:33,771 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-08 08:48:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-08 08:48:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-08 08:48:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:48:33,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:33,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:33,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:48:33,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:33,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:33,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1827093992, now seen corresponding path program 1 times [2025-02-08 08:48:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:33,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135758168] [2025-02-08 08:48:33,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:33,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:48:33,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:48:33,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:33,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135758168] [2025-02-08 08:48:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135758168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903339046] [2025-02-08 08:48:34,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:34,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:34,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:34,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:34,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:48:34,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:48:34,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:48:34,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:34,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:48:34,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:34,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:48:34,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903339046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:34,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:48:34,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-08 08:48:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245014154] [2025-02-08 08:48:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:34,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:48:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:34,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:48:34,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:48:34,114 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 08:48:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:34,125 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-02-08 08:48:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:48:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2025-02-08 08:48:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:34,126 INFO L225 Difference]: With dead ends: 56 [2025-02-08 08:48:34,126 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 08:48:34,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-02-08 08:48:34,127 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 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-02-08 08:48:34,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 08:48:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 08:48:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 33 states have internal predecessors, (41), 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-02-08 08:48:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-02-08 08:48:34,133 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2025-02-08 08:48:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:34,133 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-02-08 08:48:34,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-02-08 08:48:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-02-08 08:48:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:48:34,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:34,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:34,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:48:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:34,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1962314679, now seen corresponding path program 1 times [2025-02-08 08:48:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135921573] [2025-02-08 08:48:34,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:34,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:48:34,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:48:34,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:34,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:34,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135921573] [2025-02-08 08:48:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135921573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995994584] [2025-02-08 08:48:34,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:34,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:34,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:34,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:48:34,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:48:34,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:48:34,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:34,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:48:34,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:34,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:34,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995994584] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:34,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:34,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-02-08 08:48:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501597062] [2025-02-08 08:48:34,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:34,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:48:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:34,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:48:34,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:48:34,513 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-02-08 08:48:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:34,538 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2025-02-08 08:48:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:48:34,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 20 [2025-02-08 08:48:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:34,540 INFO L225 Difference]: With dead ends: 75 [2025-02-08 08:48:34,540 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 08:48:34,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:48:34,541 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:34,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 08:48:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 08:48:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 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-02-08 08:48:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-08 08:48:34,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2025-02-08 08:48:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:34,546 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-08 08:48:34,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-02-08 08:48:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-08 08:48:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:48:34,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:34,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:34,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:48:34,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 08:48:34,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1279281655, now seen corresponding path program 2 times [2025-02-08 08:48:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67234635] [2025-02-08 08:48:34,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:34,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 08:48:34,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 26 statements. [2025-02-08 08:48:34,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:48:34,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 08:48:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67234635] [2025-02-08 08:48:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67234635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:34,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:48:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504071884] [2025-02-08 08:48:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:34,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:34,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:34,797 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02-08 08:48:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:34,832 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-08 08:48:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02-08 08:48:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:34,833 INFO L225 Difference]: With dead ends: 65 [2025-02-08 08:48:34,833 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 08:48:34,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:34,834 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:34,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 08:48:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-02-08 08:48:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.275) internal successors, (51), 43 states have internal predecessors, (51), 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-02-08 08:48:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-02-08 08:48:34,843 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 26 [2025-02-08 08:48:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:34,843 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-02-08 08:48:34,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02-08 08:48:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-02-08 08:48:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 08:48:34,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:34,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:34,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:48:34,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash -934343722, now seen corresponding path program 1 times [2025-02-08 08:48:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596528501] [2025-02-08 08:48:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:34,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:48:34,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:48:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:34,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:48:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:34,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596528501] [2025-02-08 08:48:34,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596528501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:34,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322007806] [2025-02-08 08:48:34,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:34,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:34,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:34,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:34,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:48:34,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:48:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:48:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:34,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:48:34,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:35,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:48:35,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322007806] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:35,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:35,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 9] total 18 [2025-02-08 08:48:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316107585] [2025-02-08 08:48:35,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:35,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:48:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:35,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:48:35,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:48:35,126 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 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-02-08 08:48:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:35,316 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2025-02-08 08:48:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:48:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 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 27 [2025-02-08 08:48:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:35,318 INFO L225 Difference]: With dead ends: 114 [2025-02-08 08:48:35,318 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 08:48:35,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2025-02-08 08:48:35,319 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:35,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 290 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:48:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 08:48:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-02-08 08:48:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 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-02-08 08:48:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-02-08 08:48:35,327 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 27 [2025-02-08 08:48:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:35,327 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-02-08 08:48:35,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 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-02-08 08:48:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-02-08 08:48:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 08:48:35,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:35,328 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:35,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:48:35,533 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,SelfDestructingSolverStorable9 [2025-02-08 08:48:35,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:35,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:35,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1335439121, now seen corresponding path program 2 times [2025-02-08 08:48:35,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:35,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623510087] [2025-02-08 08:48:35,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:35,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:35,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 08:48:35,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 44 statements. [2025-02-08 08:48:35,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:48:35,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-08 08:48:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623510087] [2025-02-08 08:48:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623510087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:48:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:48:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:48:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653824769] [2025-02-08 08:48:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:48:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:48:35,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:35,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:48:35,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:35,575 INFO L87 Difference]: Start difference. First operand 69 states and 79 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-02-08 08:48:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:35,599 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2025-02-08 08:48:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:48:35,599 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 44 [2025-02-08 08:48:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:35,600 INFO L225 Difference]: With dead ends: 76 [2025-02-08 08:48:35,600 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 08:48:35,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:48:35,600 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:35,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:48:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 08:48:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 08:48:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 68 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 08:48:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2025-02-08 08:48:35,605 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 44 [2025-02-08 08:48:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:35,605 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2025-02-08 08:48:35,605 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-02-08 08:48:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2025-02-08 08:48:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 08:48:35,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:35,606 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:35,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:48:35,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:35,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1688927538, now seen corresponding path program 1 times [2025-02-08 08:48:35,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:35,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080812609] [2025-02-08 08:48:35,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:35,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 08:48:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 08:48:35,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-08 08:48:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080812609] [2025-02-08 08:48:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080812609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458893444] [2025-02-08 08:48:35,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:35,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:35,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:35,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:48:35,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 08:48:35,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 08:48:35,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:35,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:35,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:48:35,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:48:35,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:48:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458893444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:36,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 17] total 35 [2025-02-08 08:48:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654506985] [2025-02-08 08:48:36,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:36,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 08:48:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:36,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 08:48:36,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 08:48:36,211 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 35 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 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-02-08 08:48:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:36,643 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2025-02-08 08:48:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 08:48:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 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 52 [2025-02-08 08:48:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:36,644 INFO L225 Difference]: With dead ends: 167 [2025-02-08 08:48:36,644 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 08:48:36,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=855, Invalid=3177, Unknown=0, NotChecked=0, Total=4032 [2025-02-08 08:48:36,646 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:36,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 296 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:48:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 08:48:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2025-02-08 08:48:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 08:48:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2025-02-08 08:48:36,656 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 52 [2025-02-08 08:48:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:36,656 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2025-02-08 08:48:36,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 35 states have internal predecessors, (80), 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-02-08 08:48:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2025-02-08 08:48:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 08:48:36,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:36,662 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:36,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:48:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 08:48:36,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:36,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash -903346986, now seen corresponding path program 2 times [2025-02-08 08:48:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135333579] [2025-02-08 08:48:36,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:36,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-02-08 08:48:36,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 08:48:36,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:48:36,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-02-08 08:48:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135333579] [2025-02-08 08:48:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135333579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095734202] [2025-02-08 08:48:37,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:37,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:37,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:37,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:48:37,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-02-08 08:48:37,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 08:48:37,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:48:37,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:37,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 08:48:37,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:48:37,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:48:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095734202] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:38,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 32, 33] total 68 [2025-02-08 08:48:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980893380] [2025-02-08 08:48:38,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-08 08:48:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:38,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-08 08:48:38,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2025-02-08 08:48:38,396 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 68 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 68 states have internal predecessors, (131), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:48:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:38,602 INFO L93 Difference]: Finished difference Result 216 states and 258 transitions. [2025-02-08 08:48:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-02-08 08:48:38,602 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 68 states have internal predecessors, (131), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 81 [2025-02-08 08:48:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:38,603 INFO L225 Difference]: With dead ends: 216 [2025-02-08 08:48:38,603 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 08:48:38,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1064, Invalid=3492, Unknown=0, NotChecked=0, Total=4556 [2025-02-08 08:48:38,605 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:38,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 345 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:48:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 08:48:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-08 08:48:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 147 states have (on average 1.08843537414966) internal successors, (160), 149 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 08:48:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2025-02-08 08:48:38,611 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 81 [2025-02-08 08:48:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:38,611 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2025-02-08 08:48:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 68 states have internal predecessors, (131), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:48:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2025-02-08 08:48:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 08:48:38,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:38,612 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:38,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:48:38,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:38,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash 306675251, now seen corresponding path program 1 times [2025-02-08 08:48:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:38,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157631841] [2025-02-08 08:48:38,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:38,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 08:48:38,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 08:48:38,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:38,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1434 trivial. 0 not checked. [2025-02-08 08:48:39,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157631841] [2025-02-08 08:48:39,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157631841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741954694] [2025-02-08 08:48:39,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:48:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:39,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:39,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:48:39,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 08:48:39,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 08:48:39,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:48:39,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:39,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-08 08:48:39,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:48:40,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:48:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741954694] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:42,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 64, 65] total 132 [2025-02-08 08:48:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399228142] [2025-02-08 08:48:42,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:42,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-02-08 08:48:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:42,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-02-08 08:48:42,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4174, Invalid=13118, Unknown=0, NotChecked=0, Total=17292 [2025-02-08 08:48:42,716 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 132 states, 132 states have (on average 1.7424242424242424) internal successors, (230), 132 states have internal predecessors, (230), 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-02-08 08:48:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:48:46,363 INFO L93 Difference]: Finished difference Result 329 states and 392 transitions. [2025-02-08 08:48:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-02-08 08:48:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.7424242424242424) internal successors, (230), 132 states have internal predecessors, (230), 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 130 [2025-02-08 08:48:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:48:46,366 INFO L225 Difference]: With dead ends: 329 [2025-02-08 08:48:46,366 INFO L226 Difference]: Without dead ends: 269 [2025-02-08 08:48:46,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17613 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12769, Invalid=53023, Unknown=0, NotChecked=0, Total=65792 [2025-02-08 08:48:46,373 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:48:46,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 237 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:48:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-08 08:48:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2025-02-08 08:48:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 253 states have (on average 1.0592885375494072) internal successors, (268), 255 states have internal predecessors, (268), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 08:48:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 276 transitions. [2025-02-08 08:48:46,385 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 276 transitions. Word has length 130 [2025-02-08 08:48:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:48:46,385 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 276 transitions. [2025-02-08 08:48:46,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.7424242424242424) internal successors, (230), 132 states have internal predecessors, (230), 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-02-08 08:48:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 276 transitions. [2025-02-08 08:48:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-08 08:48:46,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:48:46,387 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:48:46,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:48:46,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:46,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:48:46,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:48:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash -173489670, now seen corresponding path program 2 times [2025-02-08 08:48:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:48:46,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989953196] [2025-02-08 08:48:46,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:48:46,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 231 statements into 2 equivalence classes. [2025-02-08 08:48:46,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 231 of 231 statements. [2025-02-08 08:48:46,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:48:46,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5960 trivial. 0 not checked. [2025-02-08 08:48:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:48:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989953196] [2025-02-08 08:48:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989953196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:48:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149857366] [2025-02-08 08:48:46,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:48:46,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:48:46,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:48:46,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:48:46,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:48:47,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 231 statements into 2 equivalence classes. [2025-02-08 08:48:47,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 231 of 231 statements. [2025-02-08 08:48:47,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:48:47,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:48:47,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-02-08 08:48:47,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:48:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-08 08:48:50,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:48:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5964 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-08 08:48:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149857366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:48:59,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:48:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 128, 129] total 260 [2025-02-08 08:48:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640896857] [2025-02-08 08:48:59,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:48:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2025-02-08 08:48:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:48:59,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2025-02-08 08:48:59,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-02-08 08:48:59,770 INFO L87 Difference]: Start difference. First operand 261 states and 276 transitions. Second operand has 260 states, 260 states have (on average 1.6192307692307693) internal successors, (421), 260 states have internal predecessors, (421), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:49:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:00,497 INFO L93 Difference]: Finished difference Result 522 states and 616 transitions. [2025-02-08 08:49:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2025-02-08 08:49:00,497 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 1.6192307692307693) internal successors, (421), 260 states have internal predecessors, (421), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 231 [2025-02-08 08:49:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:00,499 INFO L225 Difference]: With dead ends: 522 [2025-02-08 08:49:00,499 INFO L226 Difference]: Without dead ends: 452 [2025-02-08 08:49:00,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19781 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2025-02-08 08:49:00,502 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:00,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 410 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 08:49:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-08 08:49:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2025-02-08 08:49:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 445 states have (on average 1.0314606741573034) internal successors, (459), 446 states have internal predecessors, (459), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 08:49:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 467 transitions. [2025-02-08 08:49:00,517 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 467 transitions. Word has length 231 [2025-02-08 08:49:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 467 transitions. [2025-02-08 08:49:00,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 1.6192307692307693) internal successors, (421), 260 states have internal predecessors, (421), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 08:49:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 467 transitions. [2025-02-08 08:49:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-08 08:49:00,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:00,521 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:00,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:49:00,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:00,726 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:49:00,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1072577248, now seen corresponding path program 1 times [2025-02-08 08:49:00,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:00,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150334211] [2025-02-08 08:49:00,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:00,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:00,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-08 08:49:00,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-08 08:49:00,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24173 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24169 trivial. 0 not checked. [2025-02-08 08:49:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150334211] [2025-02-08 08:49:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150334211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823854486] [2025-02-08 08:49:01,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:01,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:01,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:01,150 INFO L87 Difference]: Start difference. First operand 452 states and 467 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-02-08 08:49:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:01,170 INFO L93 Difference]: Finished difference Result 452 states and 467 transitions. [2025-02-08 08:49:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 423 [2025-02-08 08:49:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:01,172 INFO L225 Difference]: With dead ends: 452 [2025-02-08 08:49:01,172 INFO L226 Difference]: Without dead ends: 451 [2025-02-08 08:49:01,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:01,173 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:01,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-08 08:49:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2025-02-08 08:49:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.0294117647058822) internal successors, (455), 442 states have internal predecessors, (455), 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-02-08 08:49:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 461 transitions. [2025-02-08 08:49:01,185 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 461 transitions. Word has length 423 [2025-02-08 08:49:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:01,186 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 461 transitions. [2025-02-08 08:49:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-02-08 08:49:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 461 transitions. [2025-02-08 08:49:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-08 08:49:01,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:01,189 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:01,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:49:01,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 08:49:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1236384468, now seen corresponding path program 1 times [2025-02-08 08:49:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324304931] [2025-02-08 08:49:01,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:01,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-08 08:49:01,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-08 08:49:01,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:01,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24173 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24169 trivial. 0 not checked. [2025-02-08 08:49:01,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:01,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324304931] [2025-02-08 08:49:01,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324304931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406456342] [2025-02-08 08:49:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:01,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:01,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:01,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:01,624 INFO L87 Difference]: Start difference. First operand 447 states and 461 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-02-08 08:49:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:01,652 INFO L93 Difference]: Finished difference Result 447 states and 461 transitions. [2025-02-08 08:49:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 424 [2025-02-08 08:49:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:01,653 INFO L225 Difference]: With dead ends: 447 [2025-02-08 08:49:01,653 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:49:01,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:01,654 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:01,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:49:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:49:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:49:01,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 424 [2025-02-08 08:49:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:01,655 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:49:01,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-02-08 08:49:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:49:01,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:49:01,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 08:49:01,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 08:49:01,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:49:01,661 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:01,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:49:02,565 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:49:02,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:49:02 BoogieIcfgContainer [2025-02-08 08:49:02,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:49:02,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:49:02,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:49:02,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:49:02,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:48:32" (3/4) ... [2025-02-08 08:49:02,576 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:49:02,580 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 08:49:02,582 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 08:49:02,582 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:49:02,582 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:49:02,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:49:02,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:49:02,644 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:49:02,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:49:02,645 INFO L158 Benchmark]: Toolchain (without parser) took 30703.21ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 133.2MB in the beginning and 158.4MB in the end (delta: -25.2MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. [2025-02-08 08:49:02,645 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:49:02,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.42ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 122.3MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:49:02,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.23ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 120.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:49:02,645 INFO L158 Benchmark]: Boogie Preprocessor took 31.84ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:49:02,646 INFO L158 Benchmark]: IcfgBuilder took 280.92ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 105.2MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:49:02,646 INFO L158 Benchmark]: TraceAbstraction took 30133.13ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 104.8MB in the beginning and 162.4MB in the end (delta: -57.6MB). Peak memory consumption was 262.1MB. Max. memory is 16.1GB. [2025-02-08 08:49:02,646 INFO L158 Benchmark]: Witness Printer took 69.94ms. Allocated memory is still 402.7MB. Free memory was 162.4MB in the beginning and 158.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:49:02,647 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.64ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.42ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 122.3MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.23ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 120.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.84ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 119.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 280.92ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 105.2MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30133.13ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 104.8MB in the beginning and 162.4MB in the end (delta: -57.6MB). Peak memory consumption was 262.1MB. Max. memory is 16.1GB. * Witness Printer took 69.94ms. Allocated memory is still 402.7MB. Free memory was 162.4MB in the beginning and 158.4MB in the end (delta: 4.0MB). 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 - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 17, TraceHistogramMax: 127, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 2591 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2080 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1589 IncrementalHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 511 mSDtfsCounter, 1589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1340 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 703 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39616 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=15, InterpolantAutomatonStates: 554, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2621 ConstructedInterpolants, 0 QuantifiedInterpolants, 4581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3349 ConjunctsInSsa, 259 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 56514/72074 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 41]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((i == 0) && (0 <= j)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:49:02,663 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 Writing output log to file Ultimate.log Result: TRUE