./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:45:45,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:45:45,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:45:45,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:45:45,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:45:46,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:45:46,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:45:46,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:45:46,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:45:46,003 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:45:46,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:45:46,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:45:46,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:45:46,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:45:46,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:45:46,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:45:46,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:45:46,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:45:46,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:45:46,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:45:46,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:45:46,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:45:46,007 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-02-08 13:45:46,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:45:46,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:45:46,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:45:46,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:45:46,220 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:45:46,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2025-02-08 13:45:47,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78dcc4503/619e617551d0443c8ba6c971de45199c/FLAG3fda85c48 [2025-02-08 13:45:47,654 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:45:47,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-1.i [2025-02-08 13:45:47,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78dcc4503/619e617551d0443c8ba6c971de45199c/FLAG3fda85c48 [2025-02-08 13:45:47,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78dcc4503/619e617551d0443c8ba6c971de45199c [2025-02-08 13:45:47,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:45:47,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:45:47,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:45:47,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:45:47,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:45:47,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:45:47" (1/1) ... [2025-02-08 13:45:47,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dac9f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:47, skipping insertion in model container [2025-02-08 13:45:47,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:45:47" (1/1) ... [2025-02-08 13:45:47,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:45:48,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:45:48,069 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:45:48,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:45:48,157 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:45:48,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48 WrapperNode [2025-02-08 13:45:48,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:45:48,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:45:48,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:45:48,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:45:48,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,202 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-02-08 13:45:48,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:45:48,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:45:48,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:45:48,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:45:48,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,253 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-02-08 13:45:48,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:45:48,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:45:48,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:45:48,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:45:48,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (1/1) ... [2025-02-08 13:45:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:45:48,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:48,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:45:48,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:45:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:45:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:45:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:45:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:45:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:45:48,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:45:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:45:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:45:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:45:48,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:45:48,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:45:48,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:45:48,458 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:45:48,459 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:45:49,210 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-02-08 13:45:49,211 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:45:49,239 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:45:49,241 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:45:49,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:49 BoogieIcfgContainer [2025-02-08 13:45:49,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:45:49,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:45:49,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:45:49,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:45:49,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:45:47" (1/3) ... [2025-02-08 13:45:49,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecdc98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:45:49, skipping insertion in model container [2025-02-08 13:45:49,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:45:48" (2/3) ... [2025-02-08 13:45:49,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecdc98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:45:49, skipping insertion in model container [2025-02-08 13:45:49,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:45:49" (3/3) ... [2025-02-08 13:45:49,249 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-1.i [2025-02-08 13:45:49,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:45:49,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test1-1.i that has 3 procedures, 220 locations, 1 initial locations, 20 loop locations, and 6 error locations. [2025-02-08 13:45:49,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:45:49,313 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;@33e640b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:45:49,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 13:45:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 205 states have (on average 1.6146341463414635) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 13:45:49,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:49,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 13:45:49,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:49,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash 11668108, now seen corresponding path program 1 times [2025-02-08 13:45:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618119012] [2025-02-08 13:45:49,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 13:45:49,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 13:45:49,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:49,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618119012] [2025-02-08 13:45:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618119012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113134092] [2025-02-08 13:45:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:49,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:45:49,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:49,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:45:49,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:49,486 INFO L87 Difference]: Start difference. First operand has 216 states, 205 states have (on average 1.6146341463414635) internal successors, (331), 211 states have internal predecessors, (331), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:49,605 INFO L93 Difference]: Finished difference Result 626 states and 987 transitions. [2025-02-08 13:45:49,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:45:49,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 13:45:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:49,615 INFO L225 Difference]: With dead ends: 626 [2025-02-08 13:45:49,615 INFO L226 Difference]: Without dead ends: 406 [2025-02-08 13:45:49,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:49,622 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 276 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:49,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 552 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-08 13:45:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 211. [2025-02-08 13:45:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 201 states have (on average 1.4577114427860696) internal successors, (293), 206 states have internal predecessors, (293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2025-02-08 13:45:49,687 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 4 [2025-02-08 13:45:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:49,688 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2025-02-08 13:45:49,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2025-02-08 13:45:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 13:45:49,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:49,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 13:45:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:45:49,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:49,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash 372147109, now seen corresponding path program 1 times [2025-02-08 13:45:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612577028] [2025-02-08 13:45:49,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:49,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:49,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 13:45:49,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 13:45:49,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:49,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612577028] [2025-02-08 13:45:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612577028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:49,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:49,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:49,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542636883] [2025-02-08 13:45:49,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:49,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:49,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:49,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:49,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:49,884 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:49,963 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2025-02-08 13:45:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 13:45:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:49,965 INFO L225 Difference]: With dead ends: 216 [2025-02-08 13:45:49,965 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 13:45:49,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:49,966 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:49,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 806 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 13:45:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2025-02-08 13:45:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4509803921568627) internal successors, (296), 209 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2025-02-08 13:45:49,974 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 5 [2025-02-08 13:45:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2025-02-08 13:45:49,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2025-02-08 13:45:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:45:49,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:49,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:45:49,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 13:45:49,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1348341187, now seen corresponding path program 1 times [2025-02-08 13:45:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805116021] [2025-02-08 13:45:49,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:49,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:45:49,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:45:49,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:49,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805116021] [2025-02-08 13:45:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805116021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946646091] [2025-02-08 13:45:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:50,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:50,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:50,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:50,073 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:50,149 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2025-02-08 13:45:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:50,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 13:45:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:50,151 INFO L225 Difference]: With dead ends: 216 [2025-02-08 13:45:50,151 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 13:45:50,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:50,152 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:50,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 807 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 13:45:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-08 13:45:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.448780487804878) internal successors, (297), 210 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-02-08 13:45:50,171 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 6 [2025-02-08 13:45:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:50,171 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-02-08 13:45:50,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-02-08 13:45:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:45:50,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:50,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:50,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:45:50,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:50,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1562691699, now seen corresponding path program 1 times [2025-02-08 13:45:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328716821] [2025-02-08 13:45:50,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:50,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:45:50,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:45:50,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:50,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328716821] [2025-02-08 13:45:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328716821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:45:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511280314] [2025-02-08 13:45:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:50,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:50,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:50,422 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:50,518 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2025-02-08 13:45:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-02-08 13:45:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:50,520 INFO L225 Difference]: With dead ends: 427 [2025-02-08 13:45:50,520 INFO L226 Difference]: Without dead ends: 218 [2025-02-08 13:45:50,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 13:45:50,523 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 105 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:50,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 663 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-08 13:45:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-02-08 13:45:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.4146341463414633) internal successors, (290), 210 states have internal predecessors, (290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 296 transitions. [2025-02-08 13:45:50,536 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 296 transitions. Word has length 78 [2025-02-08 13:45:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:50,536 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 296 transitions. [2025-02-08 13:45:50,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 296 transitions. [2025-02-08 13:45:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:45:50,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:50,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:45:50,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:50,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1346331878, now seen corresponding path program 1 times [2025-02-08 13:45:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572388346] [2025-02-08 13:45:50,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:50,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:45:50,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:45:50,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:45:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572388346] [2025-02-08 13:45:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572388346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:45:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444843980] [2025-02-08 13:45:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:50,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:45:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:50,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:45:50,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:50,663 INFO L87 Difference]: Start difference. First operand 215 states and 296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:50,746 INFO L93 Difference]: Finished difference Result 550 states and 772 transitions. [2025-02-08 13:45:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:45:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2025-02-08 13:45:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:50,748 INFO L225 Difference]: With dead ends: 550 [2025-02-08 13:45:50,748 INFO L226 Difference]: Without dead ends: 341 [2025-02-08 13:45:50,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:45:50,749 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 134 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:50,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 528 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-08 13:45:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-02-08 13:45:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 331 states have (on average 1.4350453172205437) internal successors, (475), 336 states have internal predecessors, (475), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:45:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2025-02-08 13:45:50,763 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 78 [2025-02-08 13:45:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:50,763 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2025-02-08 13:45:50,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:45:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2025-02-08 13:45:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 13:45:50,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:50,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:50,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:45:50,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:50,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash -871848343, now seen corresponding path program 1 times [2025-02-08 13:45:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354459609] [2025-02-08 13:45:50,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:50,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 13:45:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 13:45:50,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:50,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354459609] [2025-02-08 13:45:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354459609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:51,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:51,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776113301] [2025-02-08 13:45:51,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:51,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:51,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:51,035 INFO L87 Difference]: Start difference. First operand 341 states and 481 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:51,110 INFO L93 Difference]: Finished difference Result 406 states and 566 transitions. [2025-02-08 13:45:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-02-08 13:45:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:51,113 INFO L225 Difference]: With dead ends: 406 [2025-02-08 13:45:51,114 INFO L226 Difference]: Without dead ends: 404 [2025-02-08 13:45:51,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:51,114 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 185 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 865 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-08 13:45:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-02-08 13:45:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 391 states have (on average 1.411764705882353) internal successors, (552), 396 states have internal predecessors, (552), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:45:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 564 transitions. [2025-02-08 13:45:51,128 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 564 transitions. Word has length 93 [2025-02-08 13:45:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:51,128 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 564 transitions. [2025-02-08 13:45:51,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 564 transitions. [2025-02-08 13:45:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 13:45:51,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:51,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:51,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:45:51,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1324807258, now seen corresponding path program 1 times [2025-02-08 13:45:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197269556] [2025-02-08 13:45:51,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:51,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 13:45:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 13:45:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197269556] [2025-02-08 13:45:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197269556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874854760] [2025-02-08 13:45:51,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:51,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:45:51,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:45:51,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 13:45:51,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 13:45:51,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:51,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:51,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:45:51,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:51,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:45:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:51,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874854760] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:45:51,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:45:51,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 13:45:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824672792] [2025-02-08 13:45:51,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:45:51,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 13:45:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:51,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 13:45:51,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:51,837 INFO L87 Difference]: Start difference. First operand 404 states and 564 transitions. Second operand has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:45:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:51,990 INFO L93 Difference]: Finished difference Result 609 states and 852 transitions. [2025-02-08 13:45:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:45:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 97 [2025-02-08 13:45:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:51,993 INFO L225 Difference]: With dead ends: 609 [2025-02-08 13:45:51,993 INFO L226 Difference]: Without dead ends: 603 [2025-02-08 13:45:51,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 13:45:51,994 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 911 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:51,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1559 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-02-08 13:45:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2025-02-08 13:45:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 585 states have (on average 1.411965811965812) internal successors, (826), 590 states have internal predecessors, (826), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 13:45:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 844 transitions. [2025-02-08 13:45:52,009 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 844 transitions. Word has length 97 [2025-02-08 13:45:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:52,009 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 844 transitions. [2025-02-08 13:45:52,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.9) internal successors, (259), 10 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:45:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 844 transitions. [2025-02-08 13:45:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 13:45:52,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:52,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:52,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:45:52,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:52,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1891083723, now seen corresponding path program 1 times [2025-02-08 13:45:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301864127] [2025-02-08 13:45:52,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:52,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 13:45:52,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 13:45:52,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:52,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301864127] [2025-02-08 13:45:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301864127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903913869] [2025-02-08 13:45:52,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:52,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:52,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:52,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:45:52,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:45:52,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 13:45:52,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 13:45:52,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:52,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:52,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 13:45:52,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:53,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:45:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903913869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:45:53,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:45:53,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 13:45:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126800118] [2025-02-08 13:45:53,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:45:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:45:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:53,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:45:53,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:45:53,143 INFO L87 Difference]: Start difference. First operand 601 states and 844 transitions. Second operand has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:45:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:53,336 INFO L93 Difference]: Finished difference Result 808 states and 1136 transitions. [2025-02-08 13:45:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:45:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2025-02-08 13:45:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:53,339 INFO L225 Difference]: With dead ends: 808 [2025-02-08 13:45:53,340 INFO L226 Difference]: Without dead ends: 807 [2025-02-08 13:45:53,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:45:53,340 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 834 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:53,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1999 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-08 13:45:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 800. [2025-02-08 13:45:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 781 states have (on average 1.41101152368758) internal successors, (1102), 786 states have internal predecessors, (1102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:45:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1126 transitions. [2025-02-08 13:45:53,357 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1126 transitions. Word has length 98 [2025-02-08 13:45:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:53,358 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1126 transitions. [2025-02-08 13:45:53,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.583333333333334) internal successors, (187), 13 states have internal predecessors, (187), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:45:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1126 transitions. [2025-02-08 13:45:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 13:45:53,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:53,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:53,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:45:53,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:53,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:53,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1505946409, now seen corresponding path program 1 times [2025-02-08 13:45:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:53,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658562979] [2025-02-08 13:45:53,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:53,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 13:45:53,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 13:45:53,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:53,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658562979] [2025-02-08 13:45:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658562979] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844883991] [2025-02-08 13:45:53,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:53,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:53,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:45:53,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:45:54,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 13:45:54,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 13:45:54,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:54,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:54,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 13:45:54,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:54,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:45:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844883991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:45:54,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:45:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 13:45:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654813538] [2025-02-08 13:45:54,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:45:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:45:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:54,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:45:54,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:45:54,537 INFO L87 Difference]: Start difference. First operand 800 states and 1126 transitions. Second operand has 13 states, 12 states have (on average 15.833333333333334) internal successors, (190), 13 states have internal predecessors, (190), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:45:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:54,740 INFO L93 Difference]: Finished difference Result 808 states and 1133 transitions. [2025-02-08 13:45:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 13:45:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.833333333333334) internal successors, (190), 13 states have internal predecessors, (190), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 99 [2025-02-08 13:45:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:54,744 INFO L225 Difference]: With dead ends: 808 [2025-02-08 13:45:54,744 INFO L226 Difference]: Without dead ends: 807 [2025-02-08 13:45:54,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-08 13:45:54,745 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 789 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:54,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1981 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:45:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-02-08 13:45:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 801. [2025-02-08 13:45:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 782 states have (on average 1.407928388746803) internal successors, (1101), 787 states have internal predecessors, (1101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:45:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1125 transitions. [2025-02-08 13:45:54,762 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1125 transitions. Word has length 99 [2025-02-08 13:45:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:54,762 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1125 transitions. [2025-02-08 13:45:54,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.833333333333334) internal successors, (190), 13 states have internal predecessors, (190), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:45:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1125 transitions. [2025-02-08 13:45:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 13:45:54,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:54,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:54,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:45:54,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:54,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:54,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1974566272, now seen corresponding path program 1 times [2025-02-08 13:45:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614448656] [2025-02-08 13:45:54,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:54,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:55,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 13:45:55,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 13:45:55,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:55,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614448656] [2025-02-08 13:45:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614448656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212879288] [2025-02-08 13:45:55,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:55,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:55,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:55,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:45:55,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:45:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 13:45:55,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 13:45:55,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:55,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:55,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 13:45:55,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:55,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:45:55,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212879288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:45:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 13:45:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761815679] [2025-02-08 13:45:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:55,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:45:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:55,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:45:55,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:45:55,717 INFO L87 Difference]: Start difference. First operand 801 states and 1125 transitions. Second operand has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:55,856 INFO L93 Difference]: Finished difference Result 801 states and 1125 transitions. [2025-02-08 13:45:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:45:55,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-02-08 13:45:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:55,860 INFO L225 Difference]: With dead ends: 801 [2025-02-08 13:45:55,860 INFO L226 Difference]: Without dead ends: 800 [2025-02-08 13:45:55,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 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-08 13:45:55,860 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 379 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:55,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1672 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:45:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-08 13:45:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-02-08 13:45:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 782 states have (on average 1.4040920716112533) internal successors, (1098), 786 states have internal predecessors, (1098), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:45:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1122 transitions. [2025-02-08 13:45:55,878 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1122 transitions. Word has length 171 [2025-02-08 13:45:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:55,878 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1122 transitions. [2025-02-08 13:45:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1122 transitions. [2025-02-08 13:45:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-08 13:45:55,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:55,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:55,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:45:56,081 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,SelfDestructingSolverStorable9 [2025-02-08 13:45:56,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:56,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1388141952, now seen corresponding path program 1 times [2025-02-08 13:45:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992625907] [2025-02-08 13:45:56,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-08 13:45:56,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-08 13:45:56,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:56,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-08 13:45:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:56,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992625907] [2025-02-08 13:45:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992625907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:45:56,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:45:56,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:45:56,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378069658] [2025-02-08 13:45:56,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:45:56,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:45:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:56,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:45:56,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:56,318 INFO L87 Difference]: Start difference. First operand 800 states and 1122 transitions. Second operand has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:56,365 INFO L93 Difference]: Finished difference Result 800 states and 1122 transitions. [2025-02-08 13:45:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:45:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 250 [2025-02-08 13:45:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:56,369 INFO L225 Difference]: With dead ends: 800 [2025-02-08 13:45:56,370 INFO L226 Difference]: Without dead ends: 799 [2025-02-08 13:45:56,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:45:56,370 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 194 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:56,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 535 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:45:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-08 13:45:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-08 13:45:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 782 states have (on average 1.4015345268542199) internal successors, (1096), 785 states have internal predecessors, (1096), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 13:45:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1120 transitions. [2025-02-08 13:45:56,391 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1120 transitions. Word has length 250 [2025-02-08 13:45:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:56,391 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1120 transitions. [2025-02-08 13:45:56,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:45:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1120 transitions. [2025-02-08 13:45:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-08 13:45:56,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:56,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:56,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:45:56,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:56,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2103191188, now seen corresponding path program 1 times [2025-02-08 13:45:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:56,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671070932] [2025-02-08 13:45:56,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:56,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-08 13:45:56,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-08 13:45:56,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:56,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:45:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671070932] [2025-02-08 13:45:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671070932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:45:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835026558] [2025-02-08 13:45:56,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:45:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:45:56,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:45:56,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:45:57,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-08 13:45:57,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-08 13:45:57,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:45:57,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 13:45:57,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:45:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:57,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:45:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:45:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835026558] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:45:57,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:45:57,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 13:45:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506049870] [2025-02-08 13:45:57,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:45:57,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 13:45:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:45:57,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 13:45:57,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 13:45:57,876 INFO L87 Difference]: Start difference. First operand 799 states and 1120 transitions. Second operand has 18 states, 18 states have (on average 31.72222222222222) internal successors, (571), 18 states have internal predecessors, (571), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:45:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:45:58,209 INFO L93 Difference]: Finished difference Result 1392 states and 1956 transitions. [2025-02-08 13:45:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 13:45:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.72222222222222) internal successors, (571), 18 states have internal predecessors, (571), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 253 [2025-02-08 13:45:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:45:58,216 INFO L225 Difference]: With dead ends: 1392 [2025-02-08 13:45:58,216 INFO L226 Difference]: Without dead ends: 1387 [2025-02-08 13:45:58,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 13:45:58,217 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 2772 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:45:58,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2791 Valid, 2522 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:45:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-02-08 13:45:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1383. [2025-02-08 13:45:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1357 states have (on average 1.4038319823139278) internal successors, (1905), 1360 states have internal predecessors, (1905), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 13:45:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1947 transitions. [2025-02-08 13:45:58,246 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1947 transitions. Word has length 253 [2025-02-08 13:45:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:45:58,247 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1947 transitions. [2025-02-08 13:45:58,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.72222222222222) internal successors, (571), 18 states have internal predecessors, (571), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:45:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1947 transitions. [2025-02-08 13:45:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-08 13:45:58,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:45:58,250 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:45:58,261 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-08 13:45:58,451 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,SelfDestructingSolverStorable11 [2025-02-08 13:45:58,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:45:58,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:45:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1697316966, now seen corresponding path program 1 times [2025-02-08 13:45:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:45:58,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60920995] [2025-02-08 13:45:58,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:45:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:45:58,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-08 13:45:58,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-08 13:45:58,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:45:58,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:00,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:00,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60920995] [2025-02-08 13:46:00,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60920995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:46:00,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043074139] [2025-02-08 13:46:00,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:46:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:46:00,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:46:00,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:46:00,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-08 13:46:00,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-08 13:46:00,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:46:00,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:00,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 13:46:00,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:46:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:01,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:46:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043074139] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:46:01,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:46:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-08 13:46:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808293809] [2025-02-08 13:46:01,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:46:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 13:46:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:01,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 13:46:01,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:46:01,667 INFO L87 Difference]: Start difference. First operand 1383 states and 1947 transitions. Second operand has 28 states, 27 states have (on average 24.59259259259259) internal successors, (664), 28 states have internal predecessors, (664), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:46:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:02,204 INFO L93 Difference]: Finished difference Result 1985 states and 2805 transitions. [2025-02-08 13:46:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 13:46:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.59259259259259) internal successors, (664), 28 states have internal predecessors, (664), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 332 [2025-02-08 13:46:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:02,211 INFO L225 Difference]: With dead ends: 1985 [2025-02-08 13:46:02,212 INFO L226 Difference]: Without dead ends: 1984 [2025-02-08 13:46:02,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 13:46:02,213 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 3657 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3680 SdHoareTripleChecker+Valid, 4675 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:02,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3680 Valid, 4675 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:46:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-02-08 13:46:02,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1974. [2025-02-08 13:46:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1939 states have (on average 1.4038164002062918) internal successors, (2722), 1942 states have internal predecessors, (2722), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2782 transitions. [2025-02-08 13:46:02,250 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2782 transitions. Word has length 332 [2025-02-08 13:46:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 2782 transitions. [2025-02-08 13:46:02,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.59259259259259) internal successors, (664), 28 states have internal predecessors, (664), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:46:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2782 transitions. [2025-02-08 13:46:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-08 13:46:02,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:02,254 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:02,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:46:02,455 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,SelfDestructingSolverStorable12 [2025-02-08 13:46:02,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:02,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1077218716, now seen corresponding path program 1 times [2025-02-08 13:46:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:02,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984038456] [2025-02-08 13:46:02,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-08 13:46:02,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-08 13:46:02,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:46:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984038456] [2025-02-08 13:46:03,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984038456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:46:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660316833] [2025-02-08 13:46:03,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:46:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:46:03,988 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:46:03,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:46:04,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-08 13:46:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-08 13:46:04,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:46:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:04,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 13:46:04,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:46:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:04,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:46:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:05,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660316833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:46:05,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:46:05,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-08 13:46:05,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741748149] [2025-02-08 13:46:05,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:46:05,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 13:46:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:05,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 13:46:05,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-02-08 13:46:05,275 INFO L87 Difference]: Start difference. First operand 1974 states and 2782 transitions. Second operand has 28 states, 27 states have (on average 24.703703703703702) internal successors, (667), 28 states have internal predecessors, (667), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:46:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:05,803 INFO L93 Difference]: Finished difference Result 1985 states and 2799 transitions. [2025-02-08 13:46:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 13:46:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.703703703703702) internal successors, (667), 28 states have internal predecessors, (667), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 333 [2025-02-08 13:46:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:05,809 INFO L225 Difference]: With dead ends: 1985 [2025-02-08 13:46:05,810 INFO L226 Difference]: Without dead ends: 1984 [2025-02-08 13:46:05,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 13:46:05,811 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 3758 mSDsluCounter, 3245 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3781 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:05,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3781 Valid, 3545 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:46:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-02-08 13:46:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1975. [2025-02-08 13:46:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1940 states have (on average 1.4010309278350515) internal successors, (2718), 1943 states have internal predecessors, (2718), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2778 transitions. [2025-02-08 13:46:05,846 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2778 transitions. Word has length 333 [2025-02-08 13:46:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:05,847 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 2778 transitions. [2025-02-08 13:46:05,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.703703703703702) internal successors, (667), 28 states have internal predecessors, (667), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 13:46:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2778 transitions. [2025-02-08 13:46:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-02-08 13:46:05,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:05,854 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:05,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:46:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:46:06,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:06,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash 612469104, now seen corresponding path program 2 times [2025-02-08 13:46:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:06,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501981863] [2025-02-08 13:46:06,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:46:06,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:06,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 565 statements into 2 equivalence classes. [2025-02-08 13:46:06,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 565 of 565 statements. [2025-02-08 13:46:06,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:46:06,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:07,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501981863] [2025-02-08 13:46:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501981863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:46:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681245952] [2025-02-08 13:46:07,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:46:07,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:46:07,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:46:07,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:46:07,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:46:07,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 565 statements into 2 equivalence classes. [2025-02-08 13:46:08,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 565 of 565 statements. [2025-02-08 13:46:08,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:46:08,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:08,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 13:46:08,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:46:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:08,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:46:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 0 proven. 1633 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 13:46:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681245952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:46:09,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:46:09,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 13:46:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941033363] [2025-02-08 13:46:09,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:46:09,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 13:46:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:09,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 13:46:09,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 13:46:09,355 INFO L87 Difference]: Start difference. First operand 1975 states and 2778 transitions. Second operand has 23 states, 23 states have (on average 35.130434782608695) internal successors, (808), 23 states have internal predecessors, (808), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:46:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:09,757 INFO L93 Difference]: Finished difference Result 1980 states and 2783 transitions. [2025-02-08 13:46:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 13:46:09,757 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 35.130434782608695) internal successors, (808), 23 states have internal predecessors, (808), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 565 [2025-02-08 13:46:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:09,763 INFO L225 Difference]: With dead ends: 1980 [2025-02-08 13:46:09,763 INFO L226 Difference]: Without dead ends: 1975 [2025-02-08 13:46:09,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1113 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 13:46:09,763 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 2789 mSDsluCounter, 3852 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 4231 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:09,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 4231 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:46:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-02-08 13:46:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1975. [2025-02-08 13:46:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1940 states have (on average 1.3994845360824741) internal successors, (2715), 1943 states have internal predecessors, (2715), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2775 transitions. [2025-02-08 13:46:09,819 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2775 transitions. Word has length 565 [2025-02-08 13:46:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:09,820 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 2775 transitions. [2025-02-08 13:46:09,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.130434782608695) internal successors, (808), 23 states have internal predecessors, (808), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 13:46:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2775 transitions. [2025-02-08 13:46:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2025-02-08 13:46:09,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:09,849 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:09,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:46:10,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:46:10,050 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:10,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:10,050 INFO L85 PathProgramCache]: Analyzing trace with hash -454941963, now seen corresponding path program 3 times [2025-02-08 13:46:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:10,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813779191] [2025-02-08 13:46:10,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 13:46:10,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:10,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 799 statements into 12 equivalence classes. [2025-02-08 13:46:10,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 82 of 799 statements. [2025-02-08 13:46:10,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 13:46:10,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2868 trivial. 0 not checked. [2025-02-08 13:46:10,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813779191] [2025-02-08 13:46:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813779191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:46:10,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:46:10,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:46:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607135823] [2025-02-08 13:46:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:46:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:46:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:10,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:46:10,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:46:10,596 INFO L87 Difference]: Start difference. First operand 1975 states and 2775 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:11,062 INFO L93 Difference]: Finished difference Result 4205 states and 5880 transitions. [2025-02-08 13:46:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:46:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 799 [2025-02-08 13:46:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:11,076 INFO L225 Difference]: With dead ends: 4205 [2025-02-08 13:46:11,076 INFO L226 Difference]: Without dead ends: 2315 [2025-02-08 13:46:11,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:46:11,078 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 13 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:11,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 792 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:46:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2025-02-08 13:46:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2275. [2025-02-08 13:46:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2240 states have (on average 1.3772321428571428) internal successors, (3085), 2243 states have internal predecessors, (3085), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3145 transitions. [2025-02-08 13:46:11,116 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3145 transitions. Word has length 799 [2025-02-08 13:46:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:11,117 INFO L471 AbstractCegarLoop]: Abstraction has 2275 states and 3145 transitions. [2025-02-08 13:46:11,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3145 transitions. [2025-02-08 13:46:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-02-08 13:46:11,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:11,124 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:46:11,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash -144947303, now seen corresponding path program 1 times [2025-02-08 13:46:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943531719] [2025-02-08 13:46:11,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:11,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-02-08 13:46:11,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-02-08 13:46:11,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:46:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 3208 trivial. 0 not checked. [2025-02-08 13:46:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943531719] [2025-02-08 13:46:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943531719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:46:12,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:46:12,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 13:46:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746561177] [2025-02-08 13:46:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:46:12,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:46:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:12,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:46:12,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:46:12,270 INFO L87 Difference]: Start difference. First operand 2275 states and 3145 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:12,727 INFO L93 Difference]: Finished difference Result 4545 states and 6307 transitions. [2025-02-08 13:46:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 13:46:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 809 [2025-02-08 13:46:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:12,733 INFO L225 Difference]: With dead ends: 4545 [2025-02-08 13:46:12,733 INFO L226 Difference]: Without dead ends: 2395 [2025-02-08 13:46:12,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:46:12,735 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 14 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:12,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 952 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 13:46:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2025-02-08 13:46:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2365. [2025-02-08 13:46:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 2330 states have (on average 1.3798283261802575) internal successors, (3215), 2333 states have internal predecessors, (3215), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3275 transitions. [2025-02-08 13:46:12,771 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3275 transitions. Word has length 809 [2025-02-08 13:46:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:12,771 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3275 transitions. [2025-02-08 13:46:12,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3275 transitions. [2025-02-08 13:46:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-02-08 13:46:12,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:12,779 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:46:12,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1395219149, now seen corresponding path program 1 times [2025-02-08 13:46:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9491953] [2025-02-08 13:46:12,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:12,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-02-08 13:46:13,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-02-08 13:46:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:46:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 3226 trivial. 0 not checked. [2025-02-08 13:46:14,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:14,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9491953] [2025-02-08 13:46:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9491953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:46:14,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:46:14,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 13:46:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106552816] [2025-02-08 13:46:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:46:14,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 13:46:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:14,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 13:46:14,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 13:46:14,354 INFO L87 Difference]: Start difference. First operand 2365 states and 3275 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:14,954 INFO L93 Difference]: Finished difference Result 4741 states and 6580 transitions. [2025-02-08 13:46:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 13:46:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 819 [2025-02-08 13:46:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:14,960 INFO L225 Difference]: With dead ends: 4741 [2025-02-08 13:46:14,960 INFO L226 Difference]: Without dead ends: 2505 [2025-02-08 13:46:14,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 13:46:14,963 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 31 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:14,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1362 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:46:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-02-08 13:46:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2445. [2025-02-08 13:46:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2410 states have (on average 1.3755186721991701) internal successors, (3315), 2413 states have internal predecessors, (3315), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3375 transitions. [2025-02-08 13:46:14,995 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3375 transitions. Word has length 819 [2025-02-08 13:46:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:14,995 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3375 transitions. [2025-02-08 13:46:14,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3375 transitions. [2025-02-08 13:46:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-02-08 13:46:15,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:15,002 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:15,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:46:15,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:15,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -486050771, now seen corresponding path program 1 times [2025-02-08 13:46:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107417777] [2025-02-08 13:46:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:15,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes. [2025-02-08 13:46:15,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 819 of 819 statements. [2025-02-08 13:46:15,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:46:15,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:46:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 3262 trivial. 0 not checked. [2025-02-08 13:46:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:46:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107417777] [2025-02-08 13:46:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107417777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:46:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:46:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:46:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358586441] [2025-02-08 13:46:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:46:16,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:46:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:46:16,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:46:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:46:16,229 INFO L87 Difference]: Start difference. First operand 2445 states and 3375 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:46:16,603 INFO L93 Difference]: Finished difference Result 4785 states and 6615 transitions. [2025-02-08 13:46:16,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:46:16,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 819 [2025-02-08 13:46:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:46:16,609 INFO L225 Difference]: With dead ends: 4785 [2025-02-08 13:46:16,609 INFO L226 Difference]: Without dead ends: 2475 [2025-02-08 13:46:16,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:46:16,612 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 8 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:46:16,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 818 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:46:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2025-02-08 13:46:16,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2025-02-08 13:46:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2440 states have (on average 1.3709016393442623) internal successors, (3345), 2443 states have internal predecessors, (3345), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 13:46:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3405 transitions. [2025-02-08 13:46:16,666 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3405 transitions. Word has length 819 [2025-02-08 13:46:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:46:16,666 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3405 transitions. [2025-02-08 13:46:16,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:46:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3405 transitions. [2025-02-08 13:46:16,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-02-08 13:46:16,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:46:16,677 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:46:16,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 13:46:16,677 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-08 13:46:16,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:46:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1494021043, now seen corresponding path program 1 times [2025-02-08 13:46:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:46:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549998399] [2025-02-08 13:46:16,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:46:16,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:46:16,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-02-08 13:47:01,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-02-08 13:47:01,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:47:01,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:47:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3641 backedges. 532 proven. 3 refuted. 0 times theorem prover too weak. 3106 trivial. 0 not checked. [2025-02-08 13:47:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:47:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549998399] [2025-02-08 13:47:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549998399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:47:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910457356] [2025-02-08 13:47:01,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:47:01,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:47:01,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:47:01,966 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:47:01,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:47:02,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-02-08 13:47:12,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-02-08 13:47:12,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:47:12,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:47:12,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 3945 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 13:47:12,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:47:12,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-08 13:47:13,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 13:47:13,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-02-08 13:47:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3641 backedges. 1790 proven. 338 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2025-02-08 13:47:13,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:47:14,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20