./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/list-ext-properties/test-0232_1-1.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 b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:37:17,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:37:17,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:37:17,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:37:17,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:37:17,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:37:17,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:37:17,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:37:17,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:37:17,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:37:17,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:37:17,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:37:17,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:37:17,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:37:17,357 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:37:17,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:37:17,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:37:17,358 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:37:17,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:37:17,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:37:17,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:37:17,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:37:17,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:37:17,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:37:17,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:37:17,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:37:17,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:37:17,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:37:17,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:37:17,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:37:17,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:37:17,361 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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2025-02-06 13:37:17,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:37:17,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:37:17,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:37:17,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:37:17,649 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:37:17,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2025-02-06 13:37:18,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf554199b/161415774a5442079abaeee20accfbe3/FLAGabcb9de81 [2025-02-06 13:37:19,284 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:37:19,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2025-02-06 13:37:19,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf554199b/161415774a5442079abaeee20accfbe3/FLAGabcb9de81 [2025-02-06 13:37:19,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf554199b/161415774a5442079abaeee20accfbe3 [2025-02-06 13:37:19,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:37:19,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:37:19,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:37:19,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:37:19,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:37:19,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19, skipping insertion in model container [2025-02-06 13:37:19,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:37:19,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:37:19,834 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:37:19,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:37:19,891 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:37:19,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19 WrapperNode [2025-02-06 13:37:19,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:37:19,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:37:19,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:37:19,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:37:19,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,935 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-02-06 13:37:19,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:37:19,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:37:19,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:37:19,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:37:19,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,974 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2025-02-06 13:37:19,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:37:19,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:37:19,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:37:19,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:37:19,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (1/1) ... [2025-02-06 13:37:19,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:37:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:20,023 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-06 13:37:20,025 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-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 13:37:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 13:37:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:37:20,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:37:20,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:37:20,163 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:37:20,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-02-06 13:37:20,348 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-06 13:37:20,348 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:37:20,358 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:37:20,359 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:37:20,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:20 BoogieIcfgContainer [2025-02-06 13:37:20,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:37:20,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:37:20,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:37:20,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:37:20,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:37:19" (1/3) ... [2025-02-06 13:37:20,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f926c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:20, skipping insertion in model container [2025-02-06 13:37:20,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:19" (2/3) ... [2025-02-06 13:37:20,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f926c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:20, skipping insertion in model container [2025-02-06 13:37:20,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:20" (3/3) ... [2025-02-06 13:37:20,371 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2025-02-06 13:37:20,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:37:20,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232_1-1.i that has 1 procedures, 30 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-06 13:37:20,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:37:20,455 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;@4aa5157e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:37:20,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 13:37:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-06 13:37:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 13:37:20,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:20,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 13:37:20,466 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-06 13:37:20,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1999903, now seen corresponding path program 1 times [2025-02-06 13:37:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017608647] [2025-02-06 13:37:20,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:20,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 13:37:20,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 13:37:20,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:20,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:20,701 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-06 13:37:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017608647] [2025-02-06 13:37:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017608647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:37:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698068169] [2025-02-06 13:37:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:20,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:20,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:20,728 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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) 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-06 13:37:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:20,783 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-02-06 13:37:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:20,785 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-06 13:37:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:20,791 INFO L225 Difference]: With dead ends: 50 [2025-02-06 13:37:20,791 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 13:37:20,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:37:20,798 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:20,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 13:37:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-06 13:37:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 29 states have internal predecessors, (34), 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-06 13:37:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-02-06 13:37:20,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2025-02-06 13:37:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:20,831 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-02-06 13:37:20,832 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-06 13:37:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-02-06 13:37:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:37:20,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:20,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:37:20,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -686021828, now seen corresponding path program 1 times [2025-02-06 13:37:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428547731] [2025-02-06 13:37:20,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:37:20,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:37:20,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:20,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:21,322 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-06 13:37:21,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:21,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428547731] [2025-02-06 13:37:21,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428547731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:21,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:21,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:37:21,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049298403] [2025-02-06 13:37:21,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:21,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:37:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:21,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:37:21,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:37:21,325 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-06 13:37:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:21,413 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-02-06 13:37:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:37:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-06 13:37:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:21,414 INFO L225 Difference]: With dead ends: 57 [2025-02-06 13:37:21,414 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:37:21,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:37:21,415 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:21,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:37:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-02-06 13:37:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 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-06 13:37:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-02-06 13:37:21,424 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2025-02-06 13:37:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:21,424 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-02-06 13:37:21,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-06 13:37:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-02-06 13:37:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:37:21,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:21,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:21,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:37:21,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash -685992037, now seen corresponding path program 1 times [2025-02-06 13:37:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:21,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510198257] [2025-02-06 13:37:21,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:21,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:37:21,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:37:21,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:21,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:21,507 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-06 13:37:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510198257] [2025-02-06 13:37:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510198257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:21,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021450957] [2025-02-06 13:37:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:21,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:21,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:21,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:21,510 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-06 13:37:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:21,553 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-02-06 13:37:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-06 13:37:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:21,554 INFO L225 Difference]: With dead ends: 37 [2025-02-06 13:37:21,554 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 13:37:21,555 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-06 13:37:21,555 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:21,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 13:37:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 13:37:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 34 states have internal predecessors, (39), 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-06 13:37:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-02-06 13:37:21,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 9 [2025-02-06 13:37:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-02-06 13:37:21,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-06 13:37:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-02-06 13:37:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:37:21,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:21,560 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:37:21,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1098684823, now seen corresponding path program 1 times [2025-02-06 13:37:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832663828] [2025-02-06 13:37:21,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:21,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:37:21,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:37:21,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:21,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832663828] [2025-02-06 13:37:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832663828] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033877806] [2025-02-06 13:37:21,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:21,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:21,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:21,683 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-06 13:37:21,685 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-06 13:37:21,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:37:21,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:37:21,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:21,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:21,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:37:21,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:21,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:37:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033877806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:21,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:37:21,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 13:37:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921649220] [2025-02-06 13:37:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:21,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:37:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:21,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:37:21,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:37:21,874 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-06 13:37:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:21,951 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-02-06 13:37:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:37:21,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-02-06 13:37:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:21,952 INFO L225 Difference]: With dead ends: 35 [2025-02-06 13:37:21,952 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 13:37:21,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:37:21,953 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:21,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 13:37:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 13:37:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 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-06 13:37:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-06 13:37:21,960 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2025-02-06 13:37:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-06 13:37:21,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-06 13:37:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-06 13:37:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:37:21,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:21,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:21,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:37:22,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:22,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -300508857, now seen corresponding path program 1 times [2025-02-06 13:37:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831909600] [2025-02-06 13:37:22,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:22,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:37:22,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:37:22,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:22,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831909600] [2025-02-06 13:37:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831909600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:22,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:22,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:22,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570660443] [2025-02-06 13:37:22,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:22,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:22,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:22,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:22,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:22,226 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 13:37:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:22,246 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-02-06 13:37:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-02-06 13:37:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:22,249 INFO L225 Difference]: With dead ends: 34 [2025-02-06 13:37:22,249 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 13:37:22,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:37:22,250 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:22,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 13:37:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 13:37:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 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-06 13:37:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-02-06 13:37:22,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2025-02-06 13:37:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:22,256 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-02-06 13:37:22,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-06 13:37:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-02-06 13:37:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:37:22,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:22,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:22,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:37:22,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:22,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash -300494185, now seen corresponding path program 1 times [2025-02-06 13:37:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:22,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250980524] [2025-02-06 13:37:22,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:22,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:37:22,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:37:22,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:22,353 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-06 13:37:22,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:22,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250980524] [2025-02-06 13:37:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250980524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:22,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:22,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:37:22,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280819073] [2025-02-06 13:37:22,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:22,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:37:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:22,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:37:22,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:37:22,355 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-06 13:37:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:22,397 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-02-06 13:37:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:37:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2025-02-06 13:37:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:22,399 INFO L225 Difference]: With dead ends: 51 [2025-02-06 13:37:22,399 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 13:37:22,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:37:22,400 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:22,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 13:37:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-02-06 13:37:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 34 states have internal predecessors, (39), 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-06 13:37:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-02-06 13:37:22,408 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2025-02-06 13:37:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:22,408 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-02-06 13:37:22,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-06 13:37:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-02-06 13:37:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:37:22,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:22,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:22,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:37:22,411 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-06 13:37:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -725408009, now seen corresponding path program 1 times [2025-02-06 13:37:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858055920] [2025-02-06 13:37:22,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:22,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:37:22,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:37:22,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:22,462 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-06 13:37:22,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:22,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858055920] [2025-02-06 13:37:22,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858055920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:22,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833821962] [2025-02-06 13:37:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:22,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:22,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:22,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:22,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:22,463 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-06 13:37:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:22,489 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-02-06 13:37:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-06 13:37:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:22,491 INFO L225 Difference]: With dead ends: 35 [2025-02-06 13:37:22,491 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 13:37:22,492 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-06 13:37:22,492 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:22,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 13:37:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 13:37:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 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-06 13:37:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-02-06 13:37:22,500 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2025-02-06 13:37:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:22,500 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-02-06 13:37:22,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-06 13:37:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-02-06 13:37:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:37:22,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:22,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:22,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:37:22,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:22,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1012811820, now seen corresponding path program 1 times [2025-02-06 13:37:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498423622] [2025-02-06 13:37:22,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:22,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:37:22,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:37:22,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:22,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:22,601 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-06 13:37:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:22,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498423622] [2025-02-06 13:37:22,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498423622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:22,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:22,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:37:22,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795579539] [2025-02-06 13:37:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:22,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:37:22,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:22,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:37:22,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:37:22,603 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-06 13:37:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:22,656 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-02-06 13:37:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:37:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2025-02-06 13:37:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:22,657 INFO L225 Difference]: With dead ends: 46 [2025-02-06 13:37:22,657 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 13:37:22,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-06 13:37:22,658 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:22,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 13:37:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2025-02-06 13:37:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 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-06 13:37:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-02-06 13:37:22,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2025-02-06 13:37:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:22,664 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-02-06 13:37:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-06 13:37:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-02-06 13:37:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:37:22,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:22,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:22,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:37:22,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:22,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1661515972, now seen corresponding path program 1 times [2025-02-06 13:37:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293016969] [2025-02-06 13:37:22,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:22,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:37:22,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:37:22,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:22,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293016969] [2025-02-06 13:37:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293016969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011547537] [2025-02-06 13:37:22,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:22,808 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-06 13:37:22,810 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-06 13:37:22,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:37:22,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:37:22,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:22,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:22,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:37:22,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:22,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:37:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011547537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:22,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:37:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 13:37:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531625631] [2025-02-06 13:37:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:22,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:37:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:22,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:37:22,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:37:22,990 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-06 13:37:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:23,022 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-02-06 13:37:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:37:23,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-02-06 13:37:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:23,024 INFO L225 Difference]: With dead ends: 43 [2025-02-06 13:37:23,024 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 13:37:23,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:37:23,025 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:23,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 13:37:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 13:37:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 36 states have internal predecessors, (40), 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-06 13:37:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-02-06 13:37:23,031 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2025-02-06 13:37:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:23,031 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-02-06 13:37:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-06 13:37:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-02-06 13:37:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:37:23,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:23,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:23,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:23,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:23,232 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-06 13:37:23,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1645416466, now seen corresponding path program 1 times [2025-02-06 13:37:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230097969] [2025-02-06 13:37:23,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:23,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:37:23,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:37:23,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:23,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:23,277 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-06 13:37:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230097969] [2025-02-06 13:37:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230097969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:23,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:23,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:37:23,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085567945] [2025-02-06 13:37:23,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:23,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:37:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:23,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:37:23,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:37:23,279 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 13:37:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:23,287 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-02-06 13:37:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:37:23,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-02-06 13:37:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:23,287 INFO L225 Difference]: With dead ends: 37 [2025-02-06 13:37:23,288 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 13:37:23,288 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-06 13:37:23,288 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:23,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 13:37:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 13:37:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 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-06 13:37:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-02-06 13:37:23,293 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2025-02-06 13:37:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:23,293 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-02-06 13:37:23,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 13:37:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-02-06 13:37:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:37:23,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:23,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:37:23,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -32612430, now seen corresponding path program 1 times [2025-02-06 13:37:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185321803] [2025-02-06 13:37:23,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:23,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:37:23,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:37:23,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:23,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185321803] [2025-02-06 13:37:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185321803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379188442] [2025-02-06 13:37:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:23,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:23,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:23,398 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-06 13:37:23,400 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-06 13:37:23,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:37:23,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:37:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:23,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:37:23,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:23,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379188442] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:23,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 13:37:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717532396] [2025-02-06 13:37:23,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:23,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:37:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:23,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:37:23,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:37:23,663 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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-06 13:37:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:23,719 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-02-06 13:37:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:37:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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 19 [2025-02-06 13:37:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:23,722 INFO L225 Difference]: With dead ends: 69 [2025-02-06 13:37:23,722 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 13:37:23,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:37:23,723 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:23,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 116 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 13:37:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2025-02-06 13:37:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 61 states have internal predecessors, (70), 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-06 13:37:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-02-06 13:37:23,729 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 19 [2025-02-06 13:37:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:23,729 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-02-06 13:37:23,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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-06 13:37:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-02-06 13:37:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:37:23,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:23,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:23,741 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-06 13:37:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:23,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash -531697132, now seen corresponding path program 1 times [2025-02-06 13:37:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256799184] [2025-02-06 13:37:23,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:23,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:37:23,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:37:23,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:23,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:24,058 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-06 13:37:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256799184] [2025-02-06 13:37:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256799184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:24,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:24,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 13:37:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536008223] [2025-02-06 13:37:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:24,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:37:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:24,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:37:24,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:37:24,060 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-06 13:37:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:24,107 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-02-06 13:37:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:37:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2025-02-06 13:37:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:24,108 INFO L225 Difference]: With dead ends: 67 [2025-02-06 13:37:24,108 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 13:37:24,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:37:24,109 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:24,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 13:37:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 13:37:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 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-06 13:37:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-02-06 13:37:24,113 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 19 [2025-02-06 13:37:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:24,114 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-02-06 13:37:24,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-06 13:37:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-02-06 13:37:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 13:37:24,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:24,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:24,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:37:24,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash -535910773, now seen corresponding path program 1 times [2025-02-06 13:37:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235466032] [2025-02-06 13:37:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:24,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:37:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:37:24,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:24,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:24,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235466032] [2025-02-06 13:37:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235466032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145468810] [2025-02-06 13:37:24,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:24,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:24,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:24,264 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-06 13:37:24,266 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-06 13:37:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 13:37:24,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 13:37:24,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:24,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:24,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 13:37:24,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:24,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:24,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145468810] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:24,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-06 13:37:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018697471] [2025-02-06 13:37:24,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:24,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:37:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:24,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:37:24,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:37:24,584 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 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-06 13:37:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:24,654 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-02-06 13:37:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:37:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 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 25 [2025-02-06 13:37:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:24,656 INFO L225 Difference]: With dead ends: 63 [2025-02-06 13:37:24,656 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 13:37:24,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:37:24,657 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:24,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 13:37:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2025-02-06 13:37:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 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-06 13:37:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-02-06 13:37:24,669 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 25 [2025-02-06 13:37:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:24,669 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-02-06 13:37:24,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 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-06 13:37:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-02-06 13:37:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 13:37:24,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:24,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:24,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:24,874 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,SelfDestructingSolverStorable12 [2025-02-06 13:37:24,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -924421123, now seen corresponding path program 1 times [2025-02-06 13:37:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537896539] [2025-02-06 13:37:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:24,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:37:24,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:37:24,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:24,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:25,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537896539] [2025-02-06 13:37:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537896539] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403717475] [2025-02-06 13:37:25,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:25,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:25,057 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-06 13:37:25,059 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-06 13:37:25,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 13:37:25,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 13:37:25,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:25,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:25,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:37:25,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:25,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403717475] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:25,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 13:37:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868265145] [2025-02-06 13:37:25,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:25,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 13:37:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:25,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 13:37:25,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:37:25,389 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 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-06 13:37:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:25,472 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2025-02-06 13:37:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:37:25,473 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 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 28 [2025-02-06 13:37:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:25,473 INFO L225 Difference]: With dead ends: 68 [2025-02-06 13:37:25,474 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 13:37:25,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:37:25,475 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:25,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 13:37:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 13:37:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 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-06 13:37:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-06 13:37:25,479 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2025-02-06 13:37:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:25,479 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-06 13:37:25,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 18 states have internal predecessors, (64), 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-06 13:37:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-06 13:37:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 13:37:25,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:25,481 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-02-06 13:37:25,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:37:25,681 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,SelfDestructingSolverStorable13 [2025-02-06 13:37:25,681 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:25,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:25,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1393315973, now seen corresponding path program 2 times [2025-02-06 13:37:25,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:25,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353166962] [2025-02-06 13:37:25,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:25,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 13:37:25,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:37:25,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:37:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:26,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:26,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353166962] [2025-02-06 13:37:26,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353166962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:26,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123504790] [2025-02-06 13:37:26,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:26,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:26,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:26,057 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-06 13:37:26,064 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-06 13:37:26,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 13:37:26,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:37:26,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:37:26,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:26,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 13:37:26,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:26,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123504790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:26,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-06 13:37:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362860574] [2025-02-06 13:37:26,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 13:37:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:26,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 13:37:26,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 13:37:26,560 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 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-06 13:37:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:26,614 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-02-06 13:37:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 13:37:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 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 46 [2025-02-06 13:37:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:26,616 INFO L225 Difference]: With dead ends: 102 [2025-02-06 13:37:26,616 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 13:37:26,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-06 13:37:26,617 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:26,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 110 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 13:37:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 13:37:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 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-06 13:37:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-02-06 13:37:26,626 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 46 [2025-02-06 13:37:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:26,626 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-02-06 13:37:26,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.3478260869565215) internal successors, (100), 24 states have internal predecessors, (100), 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-06 13:37:26,626 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-02-06 13:37:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 13:37:26,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:26,629 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-02-06 13:37:26,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:26,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 13:37:26,829 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:26,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1459538203, now seen corresponding path program 3 times [2025-02-06 13:37:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996991964] [2025-02-06 13:37:26,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:37:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:26,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-02-06 13:37:27,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 13:37:27,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 13:37:27,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996991964] [2025-02-06 13:37:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996991964] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691496] [2025-02-06 13:37:28,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:37:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:28,032 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-06 13:37:28,033 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-06 13:37:28,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-02-06 13:37:47,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 13:37:47,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 13:37:47,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:47,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 13:37:47,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:47,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691496] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:47,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-02-06 13:37:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470576582] [2025-02-06 13:37:47,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:47,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 13:37:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:47,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 13:37:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 13:37:47,830 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 48 states, 47 states have (on average 4.425531914893617) internal successors, (208), 48 states have internal predecessors, (208), 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-06 13:37:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:47,959 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2025-02-06 13:37:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 13:37:47,959 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.425531914893617) internal successors, (208), 48 states have internal predecessors, (208), 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 100 [2025-02-06 13:37:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:47,961 INFO L225 Difference]: With dead ends: 210 [2025-02-06 13:37:47,962 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 13:37:47,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 13:37:47,964 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:47,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 185 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 13:37:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-06 13:37:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.1105769230769231) internal successors, (231), 208 states have internal predecessors, (231), 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-06 13:37:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2025-02-06 13:37:47,979 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 100 [2025-02-06 13:37:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:47,980 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2025-02-06 13:37:47,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.425531914893617) internal successors, (208), 48 states have internal predecessors, (208), 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-06 13:37:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2025-02-06 13:37:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-06 13:37:47,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:47,985 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-02-06 13:37:48,019 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-06 13:37:48,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:48,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:37:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1119392859, now seen corresponding path program 4 times [2025-02-06 13:37:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556454] [2025-02-06 13:37:48,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:37:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:48,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. [2025-02-06 13:37:48,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 13:37:48,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:37:48,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2255 backedges. 0 proven. 2255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:37:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556454] [2025-02-06 13:37:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433523019] [2025-02-06 13:37:52,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:37:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:52,102 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-06 13:37:52,103 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-06 13:37:52,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes.